./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-46.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-46.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 1ecee7f2108a17f11e960ee96ea6cb69a4c42551d60bb88393a480360c059293 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:20:53,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:20:53,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:20:53,586 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:20:53,588 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:20:53,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:20:53,621 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:20:53,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:20:53,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:20:53,623 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:20:53,623 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:20:53,624 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:20:53,624 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:20:53,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:20:53,627 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:20:53,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:20:53,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:20:53,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:20:53,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:20:53,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:20:53,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:20:53,632 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:20:53,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:20:53,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:20:53,633 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:20:53,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:20:53,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:20:53,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:20:53,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:20:53,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:20:53,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:20:53,635 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:20:53,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:20:53,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:20:53,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:20:53,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:20:53,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:20:53,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:20:53,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:20:53,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:20:53,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:20:53,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:20:53,640 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 -> 1ecee7f2108a17f11e960ee96ea6cb69a4c42551d60bb88393a480360c059293 [2024-10-24 05:20:53,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:20:53,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:20:53,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:20:53,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:20:53,947 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:20:53,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-46.i [2024-10-24 05:20:55,378 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:20:55,606 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:20:55,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-46.i [2024-10-24 05:20:55,627 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32f8a0b2d/024aaab49f084c3ca029e245e9f2eafa/FLAG9f8e95a3b [2024-10-24 05:20:55,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32f8a0b2d/024aaab49f084c3ca029e245e9f2eafa [2024-10-24 05:20:55,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:20:55,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:20:55,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:20:55,945 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:20:55,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:20:55,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:20:55" (1/1) ... [2024-10-24 05:20:55,951 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523c5f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:55, skipping insertion in model container [2024-10-24 05:20:55,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:20:55" (1/1) ... [2024-10-24 05:20:55,982 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:20:56,155 WARN L248 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-46.i[913,926] [2024-10-24 05:20:56,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:20:56,232 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:20:56,245 WARN L248 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-46.i[913,926] [2024-10-24 05:20:56,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:20:56,292 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:20:56,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56 WrapperNode [2024-10-24 05:20:56,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:20:56,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:20:56,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:20:56,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:20:56,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,361 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2024-10-24 05:20:56,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:20:56,362 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:20:56,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:20:56,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:20:56,374 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,378 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,402 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-10-24 05:20:56,402 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,420 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,428 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,432 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,439 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,448 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:20:56,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:20:56,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:20:56,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:20:56,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (1/1) ... [2024-10-24 05:20:56,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:20:56,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:20:56,486 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-10-24 05:20:56,493 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-10-24 05:20:56,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:20:56,540 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:20:56,541 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:20:56,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:20:56,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:20:56,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:20:56,626 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:20:56,628 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:20:57,110 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 05:20:57,111 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:20:57,162 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:20:57,162 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:20:57,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:57 BoogieIcfgContainer [2024-10-24 05:20:57,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:20:57,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:20:57,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:20:57,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:20:57,170 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:20:55" (1/3) ... [2024-10-24 05:20:57,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34993ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:20:57, skipping insertion in model container [2024-10-24 05:20:57,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:20:56" (2/3) ... [2024-10-24 05:20:57,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34993ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:20:57, skipping insertion in model container [2024-10-24 05:20:57,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:57" (3/3) ... [2024-10-24 05:20:57,174 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-46.i [2024-10-24 05:20:57,190 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:20:57,191 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:20:57,265 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:20:57,275 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;@1518b7b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:20:57,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:20:57,280 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 05:20:57,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 05:20:57,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:57,293 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:20:57,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:57,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:57,299 INFO L85 PathProgramCache]: Analyzing trace with hash 807607789, now seen corresponding path program 1 times [2024-10-24 05:20:57,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:20:57,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348426255] [2024-10-24 05:20:57,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:57,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:20:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:20:57,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:20:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:20:57,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:20:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:20:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:20:57,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:20:57,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:20:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:20:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:20:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:20:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:20:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:20:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:20:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:20:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:20:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:20:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:20:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:20:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:20:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:20:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:20:57,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:20:57,701 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 05:20:57,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:20:57,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348426255] [2024-10-24 05:20:57,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348426255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:20:57,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:20:57,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:20:57,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102037250] [2024-10-24 05:20:57,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:20:57,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:20:57,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:20:57,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:20:57,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:20:57,740 INFO L87 Difference]: Start difference. First operand has 69 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 45 states have internal predecessors, (65), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 05:20:57,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:20:57,798 INFO L93 Difference]: Finished difference Result 135 states and 238 transitions. [2024-10-24 05:20:57,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:20:57,801 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2024-10-24 05:20:57,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:20:57,808 INFO L225 Difference]: With dead ends: 135 [2024-10-24 05:20:57,809 INFO L226 Difference]: Without dead ends: 67 [2024-10-24 05:20:57,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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-10-24 05:20:57,818 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:20:57,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:20:57,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-24 05:20:57,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-24 05:20:57,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 43 states have internal predecessors, (58), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 05:20:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 102 transitions. [2024-10-24 05:20:57,862 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 102 transitions. Word has length 136 [2024-10-24 05:20:57,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:20:57,862 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 102 transitions. [2024-10-24 05:20:57,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 05:20:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 102 transitions. [2024-10-24 05:20:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 05:20:57,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:20:57,867 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:20:57,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:20:57,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:20:57,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:20:57,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2083810975, now seen corresponding path program 1 times [2024-10-24 05:20:57,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:20:57,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382072231] [2024-10-24 05:20:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:20:57,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:20:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:21:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:21:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:21:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:21:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:21:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:21:06,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:21:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:21:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:21:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:21:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:21:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:21:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:21:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:21:06,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:21:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:21:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:21:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:21:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:21:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:21:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:21:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:21:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 05:21:06,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:21:06,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382072231] [2024-10-24 05:21:06,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382072231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:21:06,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:21:06,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 05:21:06,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236470766] [2024-10-24 05:21:06,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:21:06,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 05:21:06,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:21:06,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 05:21:06,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:21:06,284 INFO L87 Difference]: Start difference. First operand 67 states and 102 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 05:21:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:21:07,671 INFO L93 Difference]: Finished difference Result 213 states and 316 transitions. [2024-10-24 05:21:07,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 05:21:07,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 137 [2024-10-24 05:21:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:21:07,677 INFO L225 Difference]: With dead ends: 213 [2024-10-24 05:21:07,677 INFO L226 Difference]: Without dead ends: 147 [2024-10-24 05:21:07,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:21:07,680 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 140 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 05:21:07,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 463 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 05:21:07,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-24 05:21:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 89. [2024-10-24 05:21:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 61 states have internal predecessors, (82), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 05:21:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 134 transitions. [2024-10-24 05:21:07,705 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 134 transitions. Word has length 137 [2024-10-24 05:21:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:21:07,706 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 134 transitions. [2024-10-24 05:21:07,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 7 states have internal predecessors, (30), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 05:21:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 134 transitions. [2024-10-24 05:21:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-24 05:21:07,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:21:07,709 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:21:07,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:21:07,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:21:07,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:21:07,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1818129311, now seen corresponding path program 1 times [2024-10-24 05:21:07,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:21:07,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076782601] [2024-10-24 05:21:07,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:21:07,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:21:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:21:07,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [874647318] [2024-10-24 05:21:07,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:21:07,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:21:07,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:21:07,824 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-10-24 05:21:07,825 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-10-24 05:21:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:08,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 05:21:08,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:21:08,732 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 320 proven. 96 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2024-10-24 05:21:08,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 05:21:09,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:21:09,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076782601] [2024-10-24 05:21:09,597 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-24 05:21:09,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874647318] [2024-10-24 05:21:09,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874647318] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 05:21:09,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-24 05:21:09,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-10-24 05:21:09,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769851791] [2024-10-24 05:21:09,598 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-24 05:21:09,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 05:21:09,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:21:09,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 05:21:09,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-24 05:21:09,600 INFO L87 Difference]: Start difference. First operand 89 states and 134 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-10-24 05:21:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:21:11,345 INFO L93 Difference]: Finished difference Result 265 states and 380 transitions. [2024-10-24 05:21:11,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-24 05:21:11,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 137 [2024-10-24 05:21:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:21:11,348 INFO L225 Difference]: With dead ends: 265 [2024-10-24 05:21:11,349 INFO L226 Difference]: Without dead ends: 183 [2024-10-24 05:21:11,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=287, Invalid=705, Unknown=0, NotChecked=0, Total=992 [2024-10-24 05:21:11,351 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 228 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 05:21:11,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 338 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 05:21:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-24 05:21:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 169. [2024-10-24 05:21:11,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 114 states have internal predecessors, (145), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 05:21:11,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 241 transitions. [2024-10-24 05:21:11,390 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 241 transitions. Word has length 137 [2024-10-24 05:21:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:21:11,391 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 241 transitions. [2024-10-24 05:21:11,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 9 states have internal predecessors, (39), 3 states have call successors, (22), 3 states have call predecessors, (22), 4 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2024-10-24 05:21:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 241 transitions. [2024-10-24 05:21:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 05:21:11,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:21:11,394 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:21:11,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 05:21:11,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:21:11,595 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:21:11,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:21:11,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1629670114, now seen corresponding path program 1 times [2024-10-24 05:21:11,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:21:11,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259563267] [2024-10-24 05:21:11,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:21:11,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:21:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:21:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:26,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:21:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:26,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:21:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:26,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:21:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:26,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:21:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:21:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:21:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:21:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:21:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:21:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:21:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:21:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:21:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 05:21:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:21:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 05:21:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:21:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 05:21:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:21:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 05:21:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:21:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 05:21:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:27,030 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-24 05:21:27,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:21:27,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259563267] [2024-10-24 05:21:27,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259563267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:21:27,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:21:27,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 05:21:27,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714429301] [2024-10-24 05:21:27,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:21:27,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 05:21:27,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:21:27,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 05:21:27,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-24 05:21:27,033 INFO L87 Difference]: Start difference. First operand 169 states and 241 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 05:21:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:21:31,096 INFO L93 Difference]: Finished difference Result 410 states and 582 transitions. [2024-10-24 05:21:31,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 05:21:31,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 138 [2024-10-24 05:21:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:21:31,101 INFO L225 Difference]: With dead ends: 410 [2024-10-24 05:21:31,101 INFO L226 Difference]: Without dead ends: 248 [2024-10-24 05:21:31,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-10-24 05:21:31,103 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 222 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:21:31,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 339 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-24 05:21:31,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-24 05:21:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 181. [2024-10-24 05:21:31,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 124 states have (on average 1.3064516129032258) internal successors, (162), 126 states have internal predecessors, (162), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-24 05:21:31,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 258 transitions. [2024-10-24 05:21:31,141 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 258 transitions. Word has length 138 [2024-10-24 05:21:31,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:21:31,142 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 258 transitions. [2024-10-24 05:21:31,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-24 05:21:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 258 transitions. [2024-10-24 05:21:31,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 05:21:31,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:21:31,144 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:21:31,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:21:31,145 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:21:31,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:21:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash -928605536, now seen corresponding path program 1 times [2024-10-24 05:21:31,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:21:31,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465382649] [2024-10-24 05:21:31,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:21:31,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:21:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 05:21:31,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1856772425] [2024-10-24 05:21:31,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:21:31,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:21:31,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:21:31,194 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-10-24 05:21:31,196 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-10-24 05:21:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:21:31,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:21:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:21:31,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:21:31,586 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:21:31,587 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:21:31,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 05:21:31,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 05:21:31,793 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-24 05:21:31,889 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:21:31,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:21:31 BoogieIcfgContainer [2024-10-24 05:21:31,897 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:21:31,897 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:21:31,897 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:21:31,898 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:21:31,898 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:20:57" (3/4) ... [2024-10-24 05:21:31,900 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:21:31,901 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:21:31,902 INFO L158 Benchmark]: Toolchain (without parser) took 35959.71ms. Allocated memory was 155.2MB in the beginning and 474.0MB in the end (delta: 318.8MB). Free memory was 98.3MB in the beginning and 272.7MB in the end (delta: -174.4MB). Peak memory consumption was 146.2MB. Max. memory is 16.1GB. [2024-10-24 05:21:31,902 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 155.2MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:21:31,903 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.62ms. Allocated memory is still 155.2MB. Free memory was 98.3MB in the beginning and 82.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 05:21:31,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.11ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 77.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:21:31,904 INFO L158 Benchmark]: Boogie Preprocessor took 86.39ms. Allocated memory is still 155.2MB. Free memory was 77.0MB in the beginning and 71.0MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 05:21:31,904 INFO L158 Benchmark]: RCFGBuilder took 713.69ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 71.0MB in the beginning and 175.1MB in the end (delta: -104.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-10-24 05:21:31,904 INFO L158 Benchmark]: TraceAbstraction took 34730.89ms. Allocated memory was 226.5MB in the beginning and 474.0MB in the end (delta: 247.5MB). Free memory was 174.1MB in the beginning and 272.7MB in the end (delta: -98.6MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. [2024-10-24 05:21:31,905 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 474.0MB. Free memory is still 272.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:21:31,906 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 155.2MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.62ms. Allocated memory is still 155.2MB. Free memory was 98.3MB in the beginning and 82.4MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.11ms. Allocated memory is still 155.2MB. Free memory was 82.4MB in the beginning and 77.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.39ms. Allocated memory is still 155.2MB. Free memory was 77.0MB in the beginning and 71.0MB in the end (delta: 6.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 713.69ms. Allocated memory was 155.2MB in the beginning and 226.5MB in the end (delta: 71.3MB). Free memory was 71.0MB in the beginning and 175.1MB in the end (delta: -104.2MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 34730.89ms. Allocated memory was 226.5MB in the beginning and 474.0MB in the end (delta: 247.5MB). Free memory was 174.1MB in the beginning and 272.7MB in the end (delta: -98.6MB). Peak memory consumption was 148.9MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 474.0MB. Free memory is still 272.7MB. 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 someBinaryFLOATComparisonOperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 16; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 128; [L26] unsigned char var_1_5 = 10; [L27] unsigned short int var_1_6 = 10; [L28] unsigned short int var_1_7 = 52077; [L29] unsigned short int var_1_8 = 47248; [L30] unsigned short int var_1_9 = 50; [L31] float var_1_10 = 999.2; [L32] float var_1_11 = 63.75; [L33] signed long int var_1_12 = 100000; [L34] unsigned short int var_1_13 = 8; [L35] signed long int var_1_14 = 2; [L36] signed long int var_1_15 = 32; [L37] unsigned short int var_1_16 = 64; [L38] double var_1_17 = 127.5; [L39] double var_1_18 = 32.75; [L40] signed char var_1_19 = 0; [L41] unsigned long int var_1_20 = 128; [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] FCALL updateLastVariables() [L135] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L91] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L91] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=0, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L92] var_1_3 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L94] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=128, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L95] var_1_4 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_4 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L96] RET assume_abort_if_not(var_1_4 >= 127) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_4 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L97] RET assume_abort_if_not(var_1_4 <= 254) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=10, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L98] var_1_5 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L99] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L100] CALL assume_abort_if_not(var_1_5 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L100] RET assume_abort_if_not(var_1_5 <= 127) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=52077, var_1_8=47248, var_1_9=50] [L101] var_1_7 = __VERIFIER_nondet_ushort() [L102] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L102] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L103] CALL assume_abort_if_not(var_1_7 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L103] RET assume_abort_if_not(var_1_7 <= 65534) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=47248, var_1_9=50] [L104] var_1_8 = __VERIFIER_nondet_ushort() [L105] CALL assume_abort_if_not(var_1_8 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L105] RET assume_abort_if_not(var_1_8 >= 32767) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L106] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L106] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, var_1_10=4996/5, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L107] var_1_10 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L108] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=255/4, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L109] var_1_11 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L110] RET assume_abort_if_not((var_1_11 >= -922337.2036854776000e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854776000e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_11 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L111] RET assume_abort_if_not(var_1_11 != 0.0F) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=2, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L112] var_1_14 = __VERIFIER_nondet_long() [L113] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L113] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L114] CALL assume_abort_if_not(var_1_14 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L114] RET assume_abort_if_not(var_1_14 <= 32) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=32, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L115] var_1_15 = __VERIFIER_nondet_long() [L116] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L116] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L117] CALL assume_abort_if_not(var_1_15 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L117] RET assume_abort_if_not(var_1_15 <= 32) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=64, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L118] var_1_16 = __VERIFIER_nondet_ushort() [L119] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L119] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L120] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L120] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_18=131/4, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L121] var_1_18 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L122] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=16, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L135] RET updateVariables() [L136] CALL step() [L45] COND TRUE var_1_2 && var_1_3 [L46] var_1_1 = (var_1_4 - var_1_5) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=10, var_1_7=32767, var_1_8=32767, var_1_9=50] [L50] COND FALSE !(var_1_1 <= (var_1_5 * var_1_4)) [L57] var_1_6 = var_1_5 VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L59] COND FALSE !(-100000 >= var_1_1) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L62] COND FALSE !((var_1_10 / var_1_11) == 999999.6f) VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L66] COND TRUE var_1_6 < var_1_1 VAL [isInitial=1, var_1_12=100000, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L67] COND FALSE !(var_1_5 == (~ (var_1_6 + var_1_1))) [L70] var_1_12 = ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8))) VAL [isInitial=1, var_1_12=254, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L75] EXPR -4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15))) VAL [isInitial=1, var_1_12=254, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L75] EXPR var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))) VAL [isInitial=1, var_1_12=254, var_1_13=8, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L75] COND FALSE !((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))))) [L82] var_1_13 = var_1_16 VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=255/2, var_1_19=0, var_1_1=254, var_1_20=128, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L84] var_1_17 = var_1_18 [L85] var_1_19 = 5 [L86] var_1_20 = var_1_15 [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR (((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= var_1_1) ? (var_1_9 == ((unsigned short int) (((((var_1_1 + var_1_5)) > (64)) ? ((var_1_1 + var_1_5)) : (64))))) : (((var_1_10 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_6 < var_1_1) ? ((var_1_5 == (~ (var_1_6 + var_1_1))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_6)) ? (-1) : (var_1_6))))) ? (var_1_5) : (((((-1) < (var_1_6)) ? (-1) : (var_1_6)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_9)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_1)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_16))) VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L127-L128] return ((((((((var_1_2 && var_1_3) ? (var_1_1 == ((unsigned char) (var_1_4 - var_1_5))) : (var_1_1 == ((unsigned char) (var_1_4 - var_1_5)))) && ((var_1_1 <= (var_1_5 * var_1_4)) ? (var_1_2 ? (var_1_6 == ((unsigned short int) (((((var_1_7) < (var_1_8)) ? (var_1_7) : (var_1_8))) - var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5))) : (var_1_6 == ((unsigned short int) var_1_5)))) && ((-100000 >= var_1_1) ? (var_1_9 == ((unsigned short int) (((((var_1_1 + var_1_5)) > (64)) ? ((var_1_1 + var_1_5)) : (64))))) : (((var_1_10 / var_1_11) == 999999.6f) ? (var_1_9 == ((unsigned short int) var_1_7)) : 1))) && ((var_1_6 < var_1_1) ? ((var_1_5 == (~ (var_1_6 + var_1_1))) ? (var_1_12 == ((signed long int) (((((var_1_5) > (((((-1) < (var_1_6)) ? (-1) : (var_1_6))))) ? (var_1_5) : (((((-1) < (var_1_6)) ? (-1) : (var_1_6)))))) - 1000))) : (var_1_12 == ((signed long int) ((((var_1_1) < (var_1_8)) ? (var_1_1) : (var_1_8)))))) : (var_1_12 == ((signed long int) var_1_9)))) && (((-4 >> ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_7 | ((((var_1_8) > (var_1_6)) ? (var_1_8) : (var_1_6))))) ? (var_1_3 ? (var_1_13 == ((unsigned short int) var_1_1)) : (var_1_13 == ((unsigned short int) var_1_4))) : (var_1_13 == ((unsigned short int) var_1_16)))) && (var_1_17 == ((double) var_1_18))) && (var_1_19 == ((signed char) 5))) && (var_1_20 == ((unsigned long int) var_1_15)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] [L19] reach_error() VAL [isInitial=1, var_1_12=254, var_1_13=0, var_1_14=1, var_1_15=0, var_1_16=0, var_1_17=2, var_1_18=2, var_1_19=5, var_1_1=254, var_1_20=0, var_1_2=1, var_1_3=1, var_1_4=254, var_1_5=0, var_1_6=0, var_1_7=32767, var_1_8=32767, var_1_9=50] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.6s, OverallIterations: 5, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 599 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 590 mSDsluCounter, 1238 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 862 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1119 IncrementalHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 376 mSDtfsCounter, 1119 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=181occurred in iteration=4, InterpolantAutomatonStates: 46, 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, 4 MinimizatonAttempts, 139 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 961 NumberOfCodeBlocks, 961 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 544 ConstructedInterpolants, 0 QuantifiedInterpolants, 4140 SizeOfPredicates, 4 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 3600/3696 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-10-24 05:21:31,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-46.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 1ecee7f2108a17f11e960ee96ea6cb69a4c42551d60bb88393a480360c059293 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:21:34,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:21:34,206 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:21:34,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:21:34,213 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:21:34,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:21:34,248 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:21:34,248 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:21:34,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:21:34,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:21:34,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:21:34,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:21:34,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:21:34,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:21:34,253 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:21:34,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:21:34,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:21:34,254 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:21:34,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:21:34,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:21:34,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:21:34,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:21:34,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:21:34,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:21:34,257 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:21:34,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:21:34,257 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:21:34,257 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:21:34,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:21:34,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:21:34,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:21:34,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:21:34,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:21:34,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:21:34,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:21:34,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:21:34,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:21:34,264 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:21:34,265 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:21:34,265 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:21:34,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:21:34,267 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:21:34,267 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:21:34,267 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:21:34,267 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:21:34,268 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 -> 1ecee7f2108a17f11e960ee96ea6cb69a4c42551d60bb88393a480360c059293 [2024-10-24 05:21:34,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:21:34,629 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:21:34,633 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:21:34,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:21:34,634 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:21:34,637 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-46.i [2024-10-24 05:21:36,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:21:36,391 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:21:36,392 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-46.i [2024-10-24 05:21:36,404 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe48e56a/59d306151c664808bd68762d86544df2/FLAG21c4ef722 [2024-10-24 05:21:36,419 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abe48e56a/59d306151c664808bd68762d86544df2 [2024-10-24 05:21:36,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:21:36,424 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:21:36,426 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:21:36,427 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:21:36,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:21:36,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614d8710 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36, skipping insertion in model container [2024-10-24 05:21:36,435 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:21:36,647 WARN L248 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-46.i[913,926] [2024-10-24 05:21:36,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:21:36,749 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:21:36,762 WARN L248 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-46.i[913,926] [2024-10-24 05:21:36,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:21:36,823 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:21:36,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36 WrapperNode [2024-10-24 05:21:36,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:21:36,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:21:36,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:21:36,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:21:36,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,846 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,876 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-10-24 05:21:36,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:21:36,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:21:36,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:21:36,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:21:36,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,912 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-10-24 05:21:36,913 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,913 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,936 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:21:36,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:21:36,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:21:36,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:21:36,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (1/1) ... [2024-10-24 05:21:36,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:21:36,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:21:36,984 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-10-24 05:21:36,990 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-10-24 05:21:37,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:21:37,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:21:37,029 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:21:37,029 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:21:37,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:21:37,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:21:37,111 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:21:37,114 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:21:39,692 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:21:39,692 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:21:39,751 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:21:39,751 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:21:39,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:21:39 BoogieIcfgContainer [2024-10-24 05:21:39,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:21:39,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:21:39,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:21:39,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:21:39,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:21:36" (1/3) ... [2024-10-24 05:21:39,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67114b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:21:39, skipping insertion in model container [2024-10-24 05:21:39,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:21:36" (2/3) ... [2024-10-24 05:21:39,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67114b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:21:39, skipping insertion in model container [2024-10-24 05:21:39,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:21:39" (3/3) ... [2024-10-24 05:21:39,764 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-46.i [2024-10-24 05:21:39,778 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:21:39,779 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:21:39,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:21:39,852 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;@41356cc6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:21:39,852 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:21:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 05:21:39,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 05:21:39,866 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:21:39,866 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:21:39,867 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:21:39,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:21:39,871 INFO L85 PathProgramCache]: Analyzing trace with hash -512241988, now seen corresponding path program 1 times [2024-10-24 05:21:39,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:21:39,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843894276] [2024-10-24 05:21:39,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:21:39,887 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-10-24 05:21:39,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:21:39,890 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-10-24 05:21:39,891 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-10-24 05:21:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:40,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:21:40,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:21:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 802 trivial. 0 not checked. [2024-10-24 05:21:40,333 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:21:40,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:21:40,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843894276] [2024-10-24 05:21:40,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [843894276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:21:40,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:21:40,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:21:40,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928640702] [2024-10-24 05:21:40,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:21:40,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:21:40,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:21:40,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:21:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:21:40,367 INFO L87 Difference]: Start difference. First operand has 56 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 32 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 05:21:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:21:40,767 INFO L93 Difference]: Finished difference Result 108 states and 196 transitions. [2024-10-24 05:21:40,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:21:40,787 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 132 [2024-10-24 05:21:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:21:40,793 INFO L225 Difference]: With dead ends: 108 [2024-10-24 05:21:40,793 INFO L226 Difference]: Without dead ends: 53 [2024-10-24 05:21:40,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-10-24 05:21:40,799 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:21:40,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 05:21:40,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-24 05:21:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-24 05:21:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 05:21:40,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2024-10-24 05:21:40,837 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 79 transitions. Word has length 132 [2024-10-24 05:21:40,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:21:40,837 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 79 transitions. [2024-10-24 05:21:40,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-24 05:21:40,838 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 79 transitions. [2024-10-24 05:21:40,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 05:21:40,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:21:40,845 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 05:21:40,856 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-10-24 05:21:41,049 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-10-24 05:21:41,050 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:21:41,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:21:41,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1829865864, now seen corresponding path program 1 times [2024-10-24 05:21:41,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:21:41,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037937435] [2024-10-24 05:21:41,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:21:41,054 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-10-24 05:21:41,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:21:41,056 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-10-24 05:21:41,057 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-10-24 05:21:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:21:41,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 05:21:41,416 INFO L278 TraceCheckSpWp]: Computing forward predicates...