./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb87e983d21d7edfae5fed43f2c976d705085cd9bb7ca844eb724af3c5ed0b1d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:20:55,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:20:55,842 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:20:55,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:20:55,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:20:55,872 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:20:55,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:20:55,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:20:55,875 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:20:55,877 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:20:55,877 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:20:55,877 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:20:55,878 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:20:55,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:20:55,880 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:20:55,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:20:55,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:20:55,881 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:20:55,881 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:20:55,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:20:55,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:20:55,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:20:55,884 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:20:55,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:20:55,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:20:55,885 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:20:55,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:20:55,886 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:20:55,886 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:20:55,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:20:55,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:20:55,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:20:55,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:20:55,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:20:55,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:20:55,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:20:55,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:20:55,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:20:55,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:20:55,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:20:55,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:20:55,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:20:55,890 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb87e983d21d7edfae5fed43f2c976d705085cd9bb7ca844eb724af3c5ed0b1d [2024-11-10 03:20:56,157 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:20:56,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:20:56,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:20:56,185 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:20:56,186 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:20:56,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i [2024-11-10 03:20:57,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:20:58,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:20:58,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i [2024-11-10 03:20:58,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa58b4008/2712e61c6b1e43618703fc01554dbdff/FLAG31cde0e5c [2024-11-10 03:20:58,057 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa58b4008/2712e61c6b1e43618703fc01554dbdff [2024-11-10 03:20:58,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:20:58,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:20:58,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:20:58,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:20:58,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:20:58,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67b36a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58, skipping insertion in model container [2024-11-10 03:20:58,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,108 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:20:58,294 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i[912,925] [2024-11-10 03:20:58,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:20:58,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:20:58,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i[912,925] [2024-11-10 03:20:58,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:20:58,430 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:20:58,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58 WrapperNode [2024-11-10 03:20:58,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:20:58,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:20:58,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:20:58,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:20:58,455 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,503 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2024-11-10 03:20:58,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:20:58,508 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:20:58,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:20:58,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:20:58,522 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,527 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,552 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:20:58,552 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,560 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,561 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,565 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:20:58,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:20:58,569 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:20:58,569 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:20:58,570 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (1/1) ... [2024-11-10 03:20:58,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:20:58,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:20:58,613 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:20:58,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:20:58,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:20:58,664 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:20:58,665 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:20:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:20:58,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:20:58,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:20:58,752 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:20:58,754 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:20:59,079 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:20:59,079 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:20:59,127 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:20:59,130 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:20:59,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:20:59 BoogieIcfgContainer [2024-11-10 03:20:59,131 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:20:59,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:20:59,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:20:59,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:20:59,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:20:58" (1/3) ... [2024-11-10 03:20:59,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4940e330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:20:59, skipping insertion in model container [2024-11-10 03:20:59,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:20:58" (2/3) ... [2024-11-10 03:20:59,141 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4940e330 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:20:59, skipping insertion in model container [2024-11-10 03:20:59,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:20:59" (3/3) ... [2024-11-10 03:20:59,145 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-4.i [2024-11-10 03:20:59,161 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:20:59,162 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:20:59,234 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:20:59,241 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56d39d57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:20:59,241 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:20:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:20:59,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-10 03:20:59,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:20:59,266 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:20:59,267 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:20:59,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:20:59,271 INFO L85 PathProgramCache]: Analyzing trace with hash 2000345357, now seen corresponding path program 1 times [2024-11-10 03:20:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:20:59,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648344300] [2024-11-10 03:20:59,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:20:59,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:20:59,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:20:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:20:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:20:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:20:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:20:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:20:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:20:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:20:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:20:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:20:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:20:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:20:59,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:20:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:20:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:20:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:20:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:20:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:20:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:20:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 03:20:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:20:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:20:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:20:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:20:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:20:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:20:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:20:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:20:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 03:20:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 03:20:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:20:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-10 03:20:59,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:20:59,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648344300] [2024-11-10 03:20:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648344300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:20:59,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:20:59,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:20:59,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167389419] [2024-11-10 03:20:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:20:59,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:20:59,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:20:59,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:20:59,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:20:59,851 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:20:59,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:20:59,883 INFO L93 Difference]: Finished difference Result 150 states and 267 transitions. [2024-11-10 03:20:59,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:20:59,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 183 [2024-11-10 03:20:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:20:59,892 INFO L225 Difference]: With dead ends: 150 [2024-11-10 03:20:59,892 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 03:20:59,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:20:59,899 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:20:59,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:20:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 03:20:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-10 03:20:59,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:20:59,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2024-11-10 03:20:59,943 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 183 [2024-11-10 03:20:59,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:20:59,944 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2024-11-10 03:20:59,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:20:59,944 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2024-11-10 03:20:59,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-10 03:20:59,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:20:59,948 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:20:59,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:20:59,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:20:59,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:20:59,950 INFO L85 PathProgramCache]: Analyzing trace with hash 343091339, now seen corresponding path program 1 times [2024-11-10 03:20:59,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:20:59,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664377471] [2024-11-10 03:20:59,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:20:59,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:21:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:00,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:21:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:00,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:21:00,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:00,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:21:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:00,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:21:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:00,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:21:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:00,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:21:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:21:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:21:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:21:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:21:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:21:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:21:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:21:01,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:21:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:21:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:21:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:21:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:21:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:21:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 03:21:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:21:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:21:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:21:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:21:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:21:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:21:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:21:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:21:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 03:21:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 03:21:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 03:21:01,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:21:01,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664377471] [2024-11-10 03:21:01,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664377471] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:21:01,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280617895] [2024-11-10 03:21:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:01,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:21:01,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:01,217 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:21:01,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:21:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:01,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 03:21:01,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:21:01,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 519 proven. 72 refuted. 0 times theorem prover too weak. 1149 trivial. 0 not checked. [2024-11-10 03:21:01,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:21:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 15 proven. 72 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 03:21:02,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280617895] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:21:02,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 03:21:02,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-10 03:21:02,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41580320] [2024-11-10 03:21:02,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 03:21:02,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 03:21:02,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:21:02,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 03:21:02,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-10 03:21:02,318 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-10 03:21:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:21:03,089 INFO L93 Difference]: Finished difference Result 256 states and 368 transitions. [2024-11-10 03:21:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 03:21:03,090 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 183 [2024-11-10 03:21:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:21:03,094 INFO L225 Difference]: With dead ends: 256 [2024-11-10 03:21:03,094 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 03:21:03,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 421 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=396, Unknown=0, NotChecked=0, Total=600 [2024-11-10 03:21:03,097 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 257 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 03:21:03,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 297 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 03:21:03,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 03:21:03,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 105. [2024-11-10 03:21:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 68 states have internal predecessors, (87), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 03:21:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-10 03:21:03,119 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 183 [2024-11-10 03:21:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:21:03,120 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-10 03:21:03,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-10 03:21:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-10 03:21:03,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-10 03:21:03,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:03,123 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:21:03,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:21:03,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:21:03,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:03,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1172880014, now seen corresponding path program 1 times [2024-11-10 03:21:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:21:03,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681777610] [2024-11-10 03:21:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:03,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:21:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:21:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:21:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:21:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:21:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:21:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:21:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:21:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:21:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:21:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:21:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:21:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 03:21:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:21:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 03:21:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:21:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:21:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:21:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-10 03:21:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:21:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-10 03:21:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:21:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-10 03:21:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:21:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-10 03:21:03,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:21:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-10 03:21:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 03:21:03,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-10 03:21:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 03:21:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-10 03:21:03,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 03:21:03,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:21:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681777610] [2024-11-10 03:21:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681777610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:21:03,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215994455] [2024-11-10 03:21:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:03,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:21:03,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:03,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:21:03,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 03:21:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:03,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 03:21:03,854 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:21:04,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 659 proven. 66 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-11-10 03:21:04,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:21:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 21 proven. 66 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-10 03:21:04,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215994455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:21:04,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 03:21:04,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 03:21:04,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138457925] [2024-11-10 03:21:04,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 03:21:04,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:21:04,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:21:04,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:21:04,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:21:04,354 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-10 03:21:04,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:21:04,568 INFO L93 Difference]: Finished difference Result 210 states and 302 transitions. [2024-11-10 03:21:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 03:21:04,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 184 [2024-11-10 03:21:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:21:04,572 INFO L225 Difference]: With dead ends: 210 [2024-11-10 03:21:04,572 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 03:21:04,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 424 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:21:04,575 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 64 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:21:04,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 154 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:21:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 03:21:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2024-11-10 03:21:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 64 states have internal predecessors, (73), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 03:21:04,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2024-11-10 03:21:04,598 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 184 [2024-11-10 03:21:04,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:21:04,599 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2024-11-10 03:21:04,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-10 03:21:04,599 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2024-11-10 03:21:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-10 03:21:04,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:04,602 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:21:04,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 03:21:04,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-10 03:21:04,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:04,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:04,804 INFO L85 PathProgramCache]: Analyzing trace with hash -285805035, now seen corresponding path program 1 times [2024-11-10 03:21:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:21:04,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30322312] [2024-11-10 03:21:04,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:04,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:21:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:21:04,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [266128775] [2024-11-10 03:21:04,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:04,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:21:04,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:04,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:21:04,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 03:21:05,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:21:05,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:21:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:21:05,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:21:05,757 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:21:05,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:21:05,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 03:21:05,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:21:05,968 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-10 03:21:06,087 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:21:06,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:21:06 BoogieIcfgContainer [2024-11-10 03:21:06,095 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:21:06,096 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:21:06,096 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:21:06,096 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:21:06,096 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:20:59" (3/4) ... [2024-11-10 03:21:06,099 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:21:06,100 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:21:06,101 INFO L158 Benchmark]: Toolchain (without parser) took 8038.22ms. Allocated memory was 192.9MB in the beginning and 257.9MB in the end (delta: 65.0MB). Free memory was 121.3MB in the beginning and 80.3MB in the end (delta: 41.0MB). Peak memory consumption was 108.5MB. Max. memory is 16.1GB. [2024-11-10 03:21:06,102 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:21:06,102 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.98ms. Allocated memory is still 192.9MB. Free memory was 120.9MB in the beginning and 105.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 03:21:06,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.77ms. Allocated memory is still 192.9MB. Free memory was 105.4MB in the beginning and 102.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:21:06,102 INFO L158 Benchmark]: Boogie Preprocessor took 60.18ms. Allocated memory is still 192.9MB. Free memory was 102.0MB in the beginning and 97.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:21:06,103 INFO L158 Benchmark]: IcfgBuilder took 561.82ms. Allocated memory is still 192.9MB. Free memory was 97.8MB in the beginning and 157.0MB in the end (delta: -59.2MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2024-11-10 03:21:06,103 INFO L158 Benchmark]: TraceAbstraction took 6962.18ms. Allocated memory was 192.9MB in the beginning and 257.9MB in the end (delta: 65.0MB). Free memory was 155.9MB in the beginning and 80.3MB in the end (delta: 75.7MB). Peak memory consumption was 141.0MB. Max. memory is 16.1GB. [2024-11-10 03:21:06,105 INFO L158 Benchmark]: Witness Printer took 5.32ms. Allocated memory is still 257.9MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:21:06,106 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 152.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.98ms. Allocated memory is still 192.9MB. Free memory was 120.9MB in the beginning and 105.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.77ms. Allocated memory is still 192.9MB. Free memory was 105.4MB in the beginning and 102.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.18ms. Allocated memory is still 192.9MB. Free memory was 102.0MB in the beginning and 97.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 561.82ms. Allocated memory is still 192.9MB. Free memory was 97.8MB in the beginning and 157.0MB in the end (delta: -59.2MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6962.18ms. Allocated memory was 192.9MB in the beginning and 257.9MB in the end (delta: 65.0MB). Free memory was 155.9MB in the beginning and 80.3MB in the end (delta: 75.7MB). Peak memory consumption was 141.0MB. Max. memory is 16.1GB. * Witness Printer took 5.32ms. Allocated memory is still 257.9MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned short int var_1_2 = 256; [L24] unsigned short int var_1_3 = 128; [L25] unsigned char var_1_4 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned short int var_1_6 = 4; [L28] signed short int var_1_7 = 32; [L29] signed long int var_1_8 = 100000000; [L30] unsigned short int var_1_9 = 4; [L31] unsigned short int var_1_10 = 10; [L32] double var_1_11 = 15.6; [L33] double var_1_12 = 256.4; [L34] double var_1_13 = 49.15; [L35] unsigned long int var_1_14 = 500; [L36] unsigned long int var_1_15 = 2173307753; [L37] unsigned long int var_1_16 = 3362224480; [L38] signed short int var_1_17 = 16; [L39] unsigned short int var_1_18 = 16; [L40] signed short int var_1_19 = 16; [L41] signed short int var_1_20 = 4; [L42] signed short int var_1_21 = 0; [L43] signed short int var_1_22 = -25; VAL [isInitial=0, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_2=256, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] FCALL updateLastVariables() [L145] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L89] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L89] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_3=128, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L90] var_1_3 = __VERIFIER_nondet_ushort() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L92] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L92] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L93] var_1_4 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L94] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L95] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L95] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L96] var_1_5 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L97] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L98] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L98] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=32, var_1_8=100000000, var_1_9=4] [L99] var_1_7 = __VERIFIER_nondet_short() [L100] CALL assume_abort_if_not(var_1_7 >= -32768) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L100] RET assume_abort_if_not(var_1_7 >= -32768) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L101] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L101] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=100000000, var_1_9=4] [L102] var_1_8 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L103] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L104] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L104] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L105] var_1_10 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L106] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L107] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L107] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L108] var_1_12 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L109] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L110] var_1_13 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L111] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L112] var_1_15 = __VERIFIER_nondet_ulong() [L113] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L113] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L114] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L114] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=3362224480, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L115] var_1_16 = __VERIFIER_nondet_ulong() [L116] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L116] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L117] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L117] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_18=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L118] var_1_18 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L119] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L120] CALL assume_abort_if_not(var_1_18 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L120] RET assume_abort_if_not(var_1_18 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L121] var_1_19 = __VERIFIER_nondet_short() [L122] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L122] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L123] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L123] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L124] var_1_20 = __VERIFIER_nondet_short() [L125] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L125] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L126] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L126] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L127] var_1_21 = __VERIFIER_nondet_short() [L128] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L128] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L129] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L129] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L130] var_1_22 = __VERIFIER_nondet_short() [L131] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L131] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L132] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L132] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L145] RET updateVariables() [L146] CALL step() [L47] COND FALSE !(var_1_2 <= var_1_3) [L52] var_1_1 = (var_1_4 || var_1_5) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L54] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L59] COND FALSE !(var_1_4 || var_1_1) VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=4] [L62] COND TRUE var_1_7 >= var_1_3 [L63] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L68] COND FALSE !(var_1_6 <= var_1_2) [L73] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=500, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L75] COND TRUE var_1_6 >= var_1_3 [L76] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=-1073741827, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L78] COND FALSE !(var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=-1073741827, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return ((((((var_1_2 <= var_1_3) ? (((- var_1_3) > var_1_2) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((var_1_2 * (var_1_3 + var_1_7)) > var_1_8) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_7 >= var_1_3) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_6 <= var_1_2) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((var_1_6 >= var_1_3) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - var_1_2))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (var_1_9 >= ((((var_1_18) > (var_1_7)) ? (var_1_18) : (var_1_7))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=-1073741827, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_18=0, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=-1073741827, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_18=0, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_12=2, var_1_14=-1073741827, var_1_15=3221225470, var_1_16=-1073741826, var_1_17=16, var_1_18=0, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_2=1, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=4, var_1_7=0, var_1_8=-2147483648, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 4, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 343 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 321 mSDsluCounter, 564 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 561 IncrementalHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 263 mSDtfsCounter, 561 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 971 GetRequests, 937 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=2, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 86 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1285 NumberOfCodeBlocks, 1285 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1277 ConstructedInterpolants, 0 QuantifiedInterpolants, 3114 SizeOfPredicates, 4 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 11766/12180 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:21:06,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fb87e983d21d7edfae5fed43f2c976d705085cd9bb7ca844eb724af3c5ed0b1d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:21:08,515 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:21:08,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:21:08,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:21:08,621 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:21:08,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:21:08,653 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:21:08,653 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:21:08,654 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:21:08,656 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:21:08,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:21:08,657 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:21:08,657 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:21:08,660 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:21:08,661 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:21:08,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:21:08,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:21:08,662 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:21:08,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:21:08,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:21:08,663 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:21:08,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:21:08,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:21:08,664 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:21:08,664 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:21:08,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:21:08,665 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:21:08,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:21:08,666 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:21:08,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:21:08,667 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:21:08,667 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:21:08,667 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:21:08,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:21:08,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:21:08,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:21:08,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:21:08,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:21:08,669 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:21:08,670 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:21:08,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:21:08,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:21:08,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:21:08,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:21:08,671 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fb87e983d21d7edfae5fed43f2c976d705085cd9bb7ca844eb724af3c5ed0b1d [2024-11-10 03:21:09,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:21:09,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:21:09,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:21:09,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:21:09,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:21:09,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i [2024-11-10 03:21:10,726 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:21:10,935 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:21:10,936 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i [2024-11-10 03:21:10,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5831fda73/49098c3149584075bfed53d0df502d76/FLAGe7bf1627e [2024-11-10 03:21:10,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5831fda73/49098c3149584075bfed53d0df502d76 [2024-11-10 03:21:10,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:21:10,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:21:10,974 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:21:10,976 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:21:10,981 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:21:10,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:10,982 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43a1619f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:10, skipping insertion in model container [2024-11-10 03:21:10,983 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:21:10" (1/1) ... [2024-11-10 03:21:11,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:21:11,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i[912,925] [2024-11-10 03:21:11,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:21:11,306 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:21:11,319 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-4.i[912,925] [2024-11-10 03:21:11,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:21:11,380 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:21:11,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11 WrapperNode [2024-11-10 03:21:11,381 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:21:11,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:21:11,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:21:11,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:21:11,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,442 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-11-10 03:21:11,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:21:11,444 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:21:11,444 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:21:11,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:21:11,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,480 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 03:21:11,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,493 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,498 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:21:11,499 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:21:11,499 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:21:11,499 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:21:11,500 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (1/1) ... [2024-11-10 03:21:11,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:21:11,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:21:11,538 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:21:11,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:21:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:21:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:21:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:21:11,579 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:21:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:21:11,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:21:11,656 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:21:11,659 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:21:12,361 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-10 03:21:12,361 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:21:12,376 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:21:12,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:21:12,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:12 BoogieIcfgContainer [2024-11-10 03:21:12,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:21:12,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:21:12,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:21:12,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:21:12,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:21:10" (1/3) ... [2024-11-10 03:21:12,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f5fcb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:12, skipping insertion in model container [2024-11-10 03:21:12,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:21:11" (2/3) ... [2024-11-10 03:21:12,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9f5fcb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:21:12, skipping insertion in model container [2024-11-10 03:21:12,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:21:12" (3/3) ... [2024-11-10 03:21:12,384 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-4.i [2024-11-10 03:21:12,403 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:21:12,404 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:21:12,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:21:12,476 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1d025812, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:21:12,476 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:21:12,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:21:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-10 03:21:12,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:12,493 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:21:12,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:12,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:12,498 INFO L85 PathProgramCache]: Analyzing trace with hash 2000345357, now seen corresponding path program 1 times [2024-11-10 03:21:12,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:21:12,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046615612] [2024-11-10 03:21:12,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:12,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:21:12,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:21:12,513 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:21:12,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:21:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:12,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:21:12,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:21:12,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2024-11-10 03:21:12,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:21:12,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:21:12,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046615612] [2024-11-10 03:21:12,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046615612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:21:12,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:21:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:21:12,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666893026] [2024-11-10 03:21:12,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:21:12,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:21:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:21:12,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:21:12,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:21:12,918 INFO L87 Difference]: Start difference. First operand has 79 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 47 states have internal predecessors, (62), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:21:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:21:12,951 INFO L93 Difference]: Finished difference Result 150 states and 267 transitions. [2024-11-10 03:21:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:21:12,953 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 183 [2024-11-10 03:21:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:21:12,958 INFO L225 Difference]: With dead ends: 150 [2024-11-10 03:21:12,959 INFO L226 Difference]: Without dead ends: 74 [2024-11-10 03:21:12,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:21:12,965 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:21:12,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:21:12,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-10 03:21:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-10 03:21:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:21:13,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2024-11-10 03:21:13,012 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 183 [2024-11-10 03:21:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:21:13,012 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2024-11-10 03:21:13,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-10 03:21:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2024-11-10 03:21:13,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-10 03:21:13,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:13,017 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:21:13,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 03:21:13,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:21:13,218 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:13,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:13,219 INFO L85 PathProgramCache]: Analyzing trace with hash 343091339, now seen corresponding path program 1 times [2024-11-10 03:21:13,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:21:13,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [280811908] [2024-11-10 03:21:13,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:13,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:21:13,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:21:13,222 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:21:13,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:21:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:13,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 03:21:13,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:21:14,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 635 proven. 135 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-11-10 03:21:14,453 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:21:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 33 proven. 138 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2024-11-10 03:21:14,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:21:14,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [280811908] [2024-11-10 03:21:14,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [280811908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:21:14,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 03:21:14,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2024-11-10 03:21:14,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131886989] [2024-11-10 03:21:14,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 03:21:14,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 03:21:14,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:21:14,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 03:21:14,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-10 03:21:14,974 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-10 03:21:16,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:21:16,136 INFO L93 Difference]: Finished difference Result 183 states and 266 transitions. [2024-11-10 03:21:16,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 03:21:16,137 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 183 [2024-11-10 03:21:16,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:21:16,141 INFO L225 Difference]: With dead ends: 183 [2024-11-10 03:21:16,141 INFO L226 Difference]: Without dead ends: 112 [2024-11-10 03:21:16,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 352 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=329, Unknown=0, NotChecked=0, Total=506 [2024-11-10 03:21:16,144 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 173 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 03:21:16,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 211 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 03:21:16,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-10 03:21:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2024-11-10 03:21:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.1587301587301588) internal successors, (73), 64 states have internal predecessors, (73), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 03:21:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 141 transitions. [2024-11-10 03:21:16,164 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 141 transitions. Word has length 183 [2024-11-10 03:21:16,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:21:16,165 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 141 transitions. [2024-11-10 03:21:16,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.153846153846154) internal successors, (54), 13 states have internal predecessors, (54), 3 states have call successors, (54), 3 states have call predecessors, (54), 7 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-10 03:21:16,166 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 141 transitions. [2024-11-10 03:21:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-10 03:21:16,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:21:16,169 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:21:16,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:21:16,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:21:16,374 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:21:16,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:21:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash -285805035, now seen corresponding path program 1 times [2024-11-10 03:21:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:21:16,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [581278973] [2024-11-10 03:21:16,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:21:16,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:21:16,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:21:16,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:21:16,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 03:21:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:21:16,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 03:21:16,623 INFO L278 TraceCheckSpWp]: Computing forward predicates...