./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.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 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:27:51,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:27:51,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 01:27:51,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:27:51,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:27:51,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:27:51,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:27:51,656 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:27:51,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:27:51,657 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:27:51,657 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:27:51,658 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:27:51,658 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:27:51,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:27:51,660 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:27:51,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:27:51,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:27:51,660 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:27:51,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 01:27:51,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:27:51,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:27:51,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:27:51,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:27:51,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:27:51,664 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:27:51,664 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:27:51,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:27:51,665 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:27:51,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:27:51,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:27:51,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:27:51,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:27:51,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:27:51,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:27:51,666 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:27:51,666 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:27:51,666 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 01:27:51,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 01:27:51,666 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:27:51,666 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:27:51,667 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:27:51,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:27:51,668 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 -> 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 [2024-11-12 01:27:51,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:27:51,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:27:51,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:27:51,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:27:51,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:27:51,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-11-12 01:27:53,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:27:53,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:27:53,274 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-11-12 01:27:53,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af309b0b0/7771a8141a1445e69e94e1bf80f0d975/FLAGbc6aababa [2024-11-12 01:27:53,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af309b0b0/7771a8141a1445e69e94e1bf80f0d975 [2024-11-12 01:27:53,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:27:53,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:27:53,296 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:27:53,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:27:53,299 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:27:53,300 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23d08cb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53, skipping insertion in model container [2024-11-12 01:27:53,301 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,341 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:27:53,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i[917,930] [2024-11-12 01:27:53,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:27:53,529 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:27:53,538 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i[917,930] [2024-11-12 01:27:53,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:27:53,579 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:27:53,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53 WrapperNode [2024-11-12 01:27:53,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:27:53,582 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:27:53,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:27:53,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:27:53,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,630 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-12 01:27:53,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:27:53,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:27:53,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:27:53,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:27:53,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,646 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,667 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:27:53,668 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,668 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,673 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:27:53,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:27:53,692 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:27:53,692 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:27:53,693 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (1/1) ... [2024-11-12 01:27:53,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:27:53,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:27:53,723 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:27:53,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:27:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:27:53,761 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:27:53,761 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:27:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 01:27:53,762 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:27:53,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:27:53,830 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:27:53,833 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:27:54,061 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 01:27:54,062 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:27:54,075 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:27:54,075 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:27:54,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:27:54 BoogieIcfgContainer [2024-11-12 01:27:54,076 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:27:54,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:27:54,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:27:54,081 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:27:54,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:27:53" (1/3) ... [2024-11-12 01:27:54,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563ef051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:27:54, skipping insertion in model container [2024-11-12 01:27:54,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:53" (2/3) ... [2024-11-12 01:27:54,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563ef051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:27:54, skipping insertion in model container [2024-11-12 01:27:54,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:27:54" (3/3) ... [2024-11-12 01:27:54,083 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-60.i [2024-11-12 01:27:54,094 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:27:54,094 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:27:54,136 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:27:54,141 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;@56c08198, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:27:54,141 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:27:54,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:27:54,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 01:27:54,153 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:27:54,153 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:27:54,154 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:27:54,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:27:54,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1518439049, now seen corresponding path program 1 times [2024-11-12 01:27:54,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:27:54,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325506198] [2024-11-12 01:27:54,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:27:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:27:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:27:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:27:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 01:27:54,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:27:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 01:27:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 01:27:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:27:54,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 01:27:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:27:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:27:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 01:27:54,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 01:27:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 01:27:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 01:27:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:27:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 01:27:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:27:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 01:27:54,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 01:27:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 01:27:54,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 01:27:54,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 01:27:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 01:27:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 01:27:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 01:27:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:27:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:27:54,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325506198] [2024-11-12 01:27:54,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325506198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:27:54,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:27:54,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:27:54,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762755361] [2024-11-12 01:27:54,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:27:54,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:27:54,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:27:54,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:27:54,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:27:54,603 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:27:54,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:27:54,673 INFO L93 Difference]: Finished difference Result 141 states and 246 transitions. [2024-11-12 01:27:54,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:27:54,676 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2024-11-12 01:27:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:27:54,684 INFO L225 Difference]: With dead ends: 141 [2024-11-12 01:27:54,684 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 01:27:54,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:27:54,691 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:27:54,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:27:54,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 01:27:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-12 01:27:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:27:54,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-12 01:27:54,740 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 163 [2024-11-12 01:27:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:27:54,740 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-12 01:27:54,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:27:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-12 01:27:54,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 01:27:54,743 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:27:54,743 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:27:54,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 01:27:54,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:27:54,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:27:54,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1566531793, now seen corresponding path program 1 times [2024-11-12 01:27:54,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:27:54,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510580534] [2024-11-12 01:27:54,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:54,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:27:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:27:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:27:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:27:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 01:27:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:27:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 01:27:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 01:27:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:27:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 01:27:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:27:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:27:54,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 01:27:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 01:27:54,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 01:27:54,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 01:27:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:27:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 01:27:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:27:54,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 01:27:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 01:27:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 01:27:54,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 01:27:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 01:27:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 01:27:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 01:27:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 01:27:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:27:54,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:27:54,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510580534] [2024-11-12 01:27:54,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510580534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:27:54,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:27:54,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:27:54,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351389632] [2024-11-12 01:27:54,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:27:54,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:27:54,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:27:54,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:27:54,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:27:54,983 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:27:55,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:27:55,013 INFO L93 Difference]: Finished difference Result 174 states and 261 transitions. [2024-11-12 01:27:55,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:27:55,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2024-11-12 01:27:55,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:27:55,016 INFO L225 Difference]: With dead ends: 174 [2024-11-12 01:27:55,016 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 01:27:55,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:27:55,017 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:27:55,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 247 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:27:55,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 01:27:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-11-12 01:27:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:27:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2024-11-12 01:27:55,036 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 163 [2024-11-12 01:27:55,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:27:55,036 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2024-11-12 01:27:55,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:27:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2024-11-12 01:27:55,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 01:27:55,038 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:27:55,038 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:27:55,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 01:27:55,039 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:27:55,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:27:55,039 INFO L85 PathProgramCache]: Analyzing trace with hash 676676236, now seen corresponding path program 1 times [2024-11-12 01:27:55,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:27:55,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328650841] [2024-11-12 01:27:55,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:55,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:27:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 01:27:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 01:27:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 01:27:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-12 01:27:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 01:27:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 01:27:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 01:27:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 01:27:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 01:27:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-12 01:27:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-12 01:27:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-12 01:27:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-12 01:27:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 01:27:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-12 01:27:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-12 01:27:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-12 01:27:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-12 01:27:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 01:27:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 01:27:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-12 01:27:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 01:27:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 01:27:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 01:27:55,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 01:27:55,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 01:27:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:27:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:27:55,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 01:27:55,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328650841] [2024-11-12 01:27:55,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328650841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:27:55,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:27:55,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:27:55,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076288359] [2024-11-12 01:27:55,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:27:55,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:27:55,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 01:27:55,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:27:55,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:27:55,192 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:27:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:27:55,242 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2024-11-12 01:27:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:27:55,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-11-12 01:27:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:27:55,246 INFO L225 Difference]: With dead ends: 233 [2024-11-12 01:27:55,246 INFO L226 Difference]: Without dead ends: 132 [2024-11-12 01:27:55,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:27:55,249 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 22 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:27:55,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 196 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:27:55,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-12 01:27:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 111. [2024-11-12 01:27:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 69 states have internal predecessors, (87), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:27:55,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2024-11-12 01:27:55,266 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 167 transitions. Word has length 164 [2024-11-12 01:27:55,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:27:55,266 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 167 transitions. [2024-11-12 01:27:55,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:27:55,267 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 167 transitions. [2024-11-12 01:27:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 01:27:55,268 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:27:55,268 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:27:55,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 01:27:55,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:27:55,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:27:55,269 INFO L85 PathProgramCache]: Analyzing trace with hash -132670390, now seen corresponding path program 1 times [2024-11-12 01:27:55,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 01:27:55,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791422269] [2024-11-12 01:27:55,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:55,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 01:27:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 01:27:55,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1719292860] [2024-11-12 01:27:55,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:27:55,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:27:55,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:27:55,427 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 01:27:55,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 01:27:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:27:55,542 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 01:27:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 01:27:55,689 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 01:27:55,689 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 01:27:55,690 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 01:27:55,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 01:27:55,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 01:27:55,895 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-12 01:27:55,984 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 01:27:55,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:27:55 BoogieIcfgContainer [2024-11-12 01:27:55,989 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 01:27:55,989 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 01:27:55,990 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 01:27:55,990 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 01:27:55,991 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:27:54" (3/4) ... [2024-11-12 01:27:55,993 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 01:27:55,994 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 01:27:55,994 INFO L158 Benchmark]: Toolchain (without parser) took 2699.75ms. Allocated memory was 130.0MB in the beginning and 203.4MB in the end (delta: 73.4MB). Free memory was 59.0MB in the beginning and 134.6MB in the end (delta: -75.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:27:55,995 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 130.0MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:27:55,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.26ms. Allocated memory was 130.0MB in the beginning and 203.4MB in the end (delta: 73.4MB). Free memory was 58.9MB in the beginning and 166.2MB in the end (delta: -107.4MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2024-11-12 01:27:55,995 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.79ms. Allocated memory is still 203.4MB. Free memory was 166.2MB in the beginning and 163.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 01:27:55,997 INFO L158 Benchmark]: Boogie Preprocessor took 60.58ms. Allocated memory is still 203.4MB. Free memory was 163.1MB in the beginning and 161.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 01:27:55,997 INFO L158 Benchmark]: RCFGBuilder took 383.83ms. Allocated memory is still 203.4MB. Free memory was 161.0MB in the beginning and 140.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-12 01:27:55,998 INFO L158 Benchmark]: TraceAbstraction took 1911.84ms. Allocated memory is still 203.4MB. Free memory was 140.0MB in the beginning and 135.6MB in the end (delta: 4.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-11-12 01:27:55,998 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 203.4MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 01:27:55,999 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.41ms. Allocated memory is still 130.0MB. Free memory is still 82.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 286.26ms. Allocated memory was 130.0MB in the beginning and 203.4MB in the end (delta: 73.4MB). Free memory was 58.9MB in the beginning and 166.2MB in the end (delta: -107.4MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.79ms. Allocated memory is still 203.4MB. Free memory was 166.2MB in the beginning and 163.1MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.58ms. Allocated memory is still 203.4MB. Free memory was 163.1MB in the beginning and 161.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 383.83ms. Allocated memory is still 203.4MB. Free memory was 161.0MB in the beginning and 140.0MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1911.84ms. Allocated memory is still 203.4MB. Free memory was 140.0MB in the beginning and 135.6MB in the end (delta: 4.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 203.4MB. Free memory is still 134.6MB. 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 141, overapproximation of someBinaryDOUBLEComparisonOperation at line 141. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 32; [L23] unsigned char var_1_2 = 1; [L24] float var_1_3 = 10.7; [L25] float var_1_4 = 7.8; [L26] float var_1_5 = 99.5; [L27] signed short int var_1_6 = 16; [L28] signed short int var_1_7 = 256; [L29] float var_1_8 = 256.6; [L30] unsigned char var_1_9 = 50; [L31] unsigned char var_1_10 = 5; [L32] double var_1_11 = 127.75; [L33] unsigned char var_1_12 = 1; [L34] unsigned char var_1_13 = 1; [L35] unsigned char var_1_14 = 0; [L36] double var_1_15 = 15.2; [L37] double var_1_16 = 256.5; [L38] double var_1_17 = 256.5; [L39] double var_1_18 = 0.0; [L40] double var_1_19 = 9.7; [L41] unsigned long int var_1_20 = 10000000; [L42] unsigned long int var_1_21 = 4008920074; [L43] unsigned long int var_1_22 = 128; VAL [isInitial=0, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=1, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L145] isInitial = 1 [L146] FCALL initially() [L147] COND TRUE 1 [L148] FCALL updateLastVariables() [L149] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L96] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L97] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_3=107/10, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L98] var_1_3 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L99] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_4=39/5, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L101] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] CALL assume_abort_if_not(var_1_4 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L102] RET assume_abort_if_not(var_1_4 != 0.0F) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_5=199/2, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L103] var_1_5 = __VERIFIER_nondet_float() [L104] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L104] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=16, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L105] var_1_6 = __VERIFIER_nondet_short() [L106] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L106] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L107] CALL assume_abort_if_not(var_1_6 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L107] RET assume_abort_if_not(var_1_6 <= 32766) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=256, var_1_8=1283/5, var_1_9=50] [L108] var_1_7 = __VERIFIER_nondet_short() [L109] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L109] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L110] CALL assume_abort_if_not(var_1_7 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L110] RET assume_abort_if_not(var_1_7 <= 32766) VAL [isInitial=1, var_1_10=5, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L113] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L113] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L114] var_1_12 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L115] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L116] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L116] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L117] var_1_13 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L119] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L119] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=0, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L120] var_1_14 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L121] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L122] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L122] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=76/5, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L123] var_1_15 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L124] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_17=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L125] var_1_17 = __VERIFIER_nondet_double() [L126] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L126] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_18=0, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L127] var_1_18 = __VERIFIER_nondet_double() [L128] CALL assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && 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_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L128] RET assume_abort_if_not((var_1_18 >= 4611686.018427382800e+12F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_19=97/10, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L129] var_1_19 = __VERIFIER_nondet_double() [L130] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L130] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=4008920074, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L131] var_1_21 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_21 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L132] RET assume_abort_if_not(var_1_21 >= 2147483647) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L133] CALL assume_abort_if_not(var_1_21 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L133] RET assume_abort_if_not(var_1_21 <= 4294967294) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=128, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L134] var_1_22 = __VERIFIER_nondet_ulong() [L135] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L135] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L136] CALL assume_abort_if_not(var_1_22 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L136] RET assume_abort_if_not(var_1_22 <= 4294967294) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L149] RET updateVariables() [L150] CALL step() [L47] COND FALSE !(\read(var_1_2)) [L54] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32766, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L56] COND FALSE !((- var_1_5) <= var_1_4) VAL [isInitial=1, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32766, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L61] signed long int stepLocal_0 = var_1_6 * 1; VAL [isInitial=1, stepLocal_0=32765, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32766, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=50] [L62] COND FALSE !(var_1_8 < (var_1_3 + var_1_5)) [L69] var_1_9 = var_1_10 VAL [isInitial=1, stepLocal_0=32765, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32766, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=-512] [L71] COND TRUE (var_1_8 >= var_1_3) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14)) VAL [isInitial=1, stepLocal_0=32765, var_1_10=-512, var_1_11=511/4, var_1_12=1, var_1_13=1, var_1_14=1, var_1_16=513/2, var_1_1=32766, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=-512] [L72] COND FALSE !(\read(var_1_2)) [L75] var_1_11 = var_1_15 VAL [isInitial=1, stepLocal_0=32765, var_1_10=-512, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32766, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=-512] [L80] signed short int stepLocal_1 = var_1_1; VAL [isInitial=1, stepLocal_0=32765, stepLocal_1=32766, var_1_10=-512, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32766, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=-512] [L81] COND FALSE !(((var_1_10 * var_1_7) + var_1_9) > stepLocal_1) VAL [isInitial=1, stepLocal_0=32765, var_1_10=-512, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32766, var_1_20=10000000, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=-512] [L84] COND TRUE \read(var_1_13) [L85] var_1_20 = (((((var_1_7) > (128u)) ? (var_1_7) : (128u))) + var_1_9) VAL [isInitial=1, stepLocal_0=32765, var_1_10=-512, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32766, var_1_20=32766, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=-512] [L150] RET step() [L151] CALL, EXPR property() [L141-L142] return (((((var_1_2 ? (((var_1_3 / var_1_4) <= var_1_5) ? (var_1_1 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_1 == ((signed short int) var_1_6))) : (var_1_1 == ((signed short int) var_1_7))) && (((- var_1_5) <= var_1_4) ? (((var_1_3 <= var_1_4) || var_1_2) ? (var_1_8 == ((float) 3.3f)) : 1) : 1)) && ((var_1_8 < (var_1_3 + var_1_5)) ? ((((((var_1_7) < (var_1_1)) ? (var_1_7) : (var_1_1))) > (var_1_6 * 1)) ? (var_1_9 == ((unsigned char) var_1_10)) : (var_1_9 == ((unsigned char) var_1_10))) : (var_1_9 == ((unsigned char) var_1_10)))) && (((var_1_8 >= var_1_3) || ((var_1_2 && var_1_12) || (var_1_13 || var_1_14))) ? (var_1_2 ? (var_1_11 == ((double) var_1_15)) : (var_1_11 == ((double) var_1_15))) : (var_1_11 == ((double) var_1_15)))) && ((((var_1_10 * var_1_7) + var_1_9) > var_1_1) ? (var_1_16 == ((double) (var_1_17 - (var_1_18 - var_1_19)))) : 1)) && (var_1_13 ? (var_1_20 == ((unsigned long int) (((((var_1_7) > (128u)) ? (var_1_7) : (128u))) + var_1_9))) : ((var_1_7 >= var_1_6) ? (var_1_20 == ((unsigned long int) (var_1_21 - var_1_9))) : (var_1_20 == ((unsigned long int) var_1_22)))) ; VAL [\result=0, isInitial=1, var_1_10=-512, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32766, var_1_20=32766, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=-512] [L151] RET, EXPR property() [L151] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-512, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32766, var_1_20=32766, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=-512] [L19] reach_error() VAL [isInitial=1, var_1_10=-512, var_1_11=2, var_1_12=1, var_1_13=1, var_1_14=1, var_1_15=2, var_1_16=513/2, var_1_1=32766, var_1_20=32766, var_1_21=2147483647, var_1_22=0, var_1_2=0, var_1_6=32765, var_1_7=32766, var_1_8=1283/5, var_1_9=-512] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 72 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 72 mSDsluCounter, 549 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 359 mSDtfsCounter, 25 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 818 NumberOfCodeBlocks, 818 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 487 ConstructedInterpolants, 0 QuantifiedInterpolants, 519 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3900/3900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 01:27:56,025 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.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 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 01:27:57,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 01:27:57,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 01:27:57,887 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 01:27:57,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 01:27:57,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 01:27:57,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 01:27:57,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 01:27:57,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 01:27:57,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 01:27:57,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 01:27:57,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 01:27:57,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 01:27:57,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 01:27:57,916 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 01:27:57,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 01:27:57,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 01:27:57,917 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 01:27:57,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 01:27:57,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 01:27:57,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 01:27:57,922 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 01:27:57,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 01:27:57,922 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 01:27:57,922 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 01:27:57,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 01:27:57,923 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 01:27:57,923 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 01:27:57,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 01:27:57,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 01:27:57,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 01:27:57,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 01:27:57,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 01:27:57,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 01:27:57,924 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:27:57,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 01:27:57,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 01:27:57,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 01:27:57,926 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 01:27:57,926 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 01:27:57,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 01:27:57,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 01:27:57,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 01:27:57,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 01:27:57,927 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 -> 3b724734d52539ec8c8b11115eb51bd20347412cf0ab8669dc17d8bb4c04f2d0 [2024-11-12 01:27:58,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 01:27:58,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 01:27:58,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 01:27:58,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 01:27:58,218 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 01:27:58,219 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-11-12 01:27:59,527 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 01:27:59,691 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 01:27:59,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i [2024-11-12 01:27:59,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69507d777/6e53317779c24ec79ff5d5d6acac516c/FLAG61c178f7e [2024-11-12 01:27:59,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69507d777/6e53317779c24ec79ff5d5d6acac516c [2024-11-12 01:27:59,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 01:27:59,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 01:27:59,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 01:27:59,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 01:27:59,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 01:27:59,724 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:59" (1/1) ... [2024-11-12 01:27:59,725 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18d8b98e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:27:59, skipping insertion in model container [2024-11-12 01:27:59,725 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:27:59" (1/1) ... [2024-11-12 01:27:59,751 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 01:27:59,879 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i[917,930] [2024-11-12 01:27:59,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:27:59,945 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 01:27:59,954 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-60.i[917,930] [2024-11-12 01:27:59,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 01:28:00,002 INFO L204 MainTranslator]: Completed translation [2024-11-12 01:28:00,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00 WrapperNode [2024-11-12 01:28:00,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 01:28:00,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 01:28:00,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 01:28:00,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 01:28:00,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,049 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-11-12 01:28:00,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 01:28:00,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 01:28:00,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 01:28:00,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 01:28:00,059 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,059 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,085 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 01:28:00,089 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,089 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,099 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,100 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 01:28:00,107 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 01:28:00,107 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 01:28:00,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 01:28:00,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (1/1) ... [2024-11-12 01:28:00,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 01:28:00,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 01:28:00,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 01:28:00,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 01:28:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 01:28:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 01:28:00,170 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 01:28:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 01:28:00,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 01:28:00,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 01:28:00,237 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 01:28:00,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 01:28:04,503 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-12 01:28:04,504 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 01:28:04,513 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 01:28:04,513 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 01:28:04,513 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:28:04 BoogieIcfgContainer [2024-11-12 01:28:04,513 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 01:28:04,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 01:28:04,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 01:28:04,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 01:28:04,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:27:59" (1/3) ... [2024-11-12 01:28:04,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49350a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:28:04, skipping insertion in model container [2024-11-12 01:28:04,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:00" (2/3) ... [2024-11-12 01:28:04,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49350a5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:28:04, skipping insertion in model container [2024-11-12 01:28:04,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:28:04" (3/3) ... [2024-11-12 01:28:04,519 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-60.i [2024-11-12 01:28:04,532 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 01:28:04,532 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 01:28:04,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 01:28:04,596 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;@19d6ffeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 01:28:04,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 01:28:04,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:28:04,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 01:28:04,615 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:28:04,630 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:28:04,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:28:04,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:28:04,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1518439049, now seen corresponding path program 1 times [2024-11-12 01:28:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:28:04,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976211688] [2024-11-12 01:28:04,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:28:04,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:28:04,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:28:04,653 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:28:04,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 01:28:05,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:28:05,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 01:28:05,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:28:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-12 01:28:05,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:28:05,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:28:05,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [976211688] [2024-11-12 01:28:05,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [976211688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:28:05,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:28:05,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 01:28:05,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695440890] [2024-11-12 01:28:05,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:28:05,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 01:28:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:28:05,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 01:28:05,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:28:05,165 INFO L87 Difference]: Start difference. First operand has 74 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:28:05,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:28:05,190 INFO L93 Difference]: Finished difference Result 141 states and 246 transitions. [2024-11-12 01:28:05,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 01:28:05,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 163 [2024-11-12 01:28:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:28:05,196 INFO L225 Difference]: With dead ends: 141 [2024-11-12 01:28:05,196 INFO L226 Difference]: Without dead ends: 70 [2024-11-12 01:28:05,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 01:28:05,201 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 01:28:05,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 01:28:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-12 01:28:05,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-12 01:28:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-12 01:28:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2024-11-12 01:28:05,240 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 163 [2024-11-12 01:28:05,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:28:05,240 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2024-11-12 01:28:05,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-12 01:28:05,241 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2024-11-12 01:28:05,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-12 01:28:05,245 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:28:05,245 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:28:05,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 01:28:05,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:28:05,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:28:05,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:28:05,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1566531793, now seen corresponding path program 1 times [2024-11-12 01:28:05,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:28:05,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133677001] [2024-11-12 01:28:05,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:28:05,448 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:28:05,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:28:05,451 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:28:05,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 01:28:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:28:05,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 01:28:05,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:28:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:28:05,999 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:28:06,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:28:06,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133677001] [2024-11-12 01:28:06,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133677001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:28:06,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:28:06,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:28:06,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668076378] [2024-11-12 01:28:06,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:28:06,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:28:06,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:28:06,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:28:06,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:28:06,003 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:28:09,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:28:09,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:28:09,324 INFO L93 Difference]: Finished difference Result 174 states and 261 transitions. [2024-11-12 01:28:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:28:09,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2024-11-12 01:28:09,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:28:09,329 INFO L225 Difference]: With dead ends: 174 [2024-11-12 01:28:09,330 INFO L226 Difference]: Without dead ends: 107 [2024-11-12 01:28:09,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:28:09,333 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 50 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:28:09,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 246 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-12 01:28:09,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-12 01:28:09,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-11-12 01:28:09,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 62 states have internal predecessors, (75), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:28:09,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2024-11-12 01:28:09,355 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 163 [2024-11-12 01:28:09,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:28:09,358 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2024-11-12 01:28:09,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:28:09,359 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2024-11-12 01:28:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 01:28:09,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:28:09,360 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:28:09,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 01:28:09,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:28:09,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:28:09,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:28:09,562 INFO L85 PathProgramCache]: Analyzing trace with hash 676676236, now seen corresponding path program 1 times [2024-11-12 01:28:09,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:28:09,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [301072911] [2024-11-12 01:28:09,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:28:09,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:28:09,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:28:09,565 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:28:09,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 01:28:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:28:09,966 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 01:28:09,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 01:28:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-12 01:28:10,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 01:28:10,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 01:28:10,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [301072911] [2024-11-12 01:28:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [301072911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 01:28:10,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 01:28:10,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 01:28:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295171901] [2024-11-12 01:28:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 01:28:10,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 01:28:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 01:28:10,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 01:28:10,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:28:10,050 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:28:12,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 01:28:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 01:28:12,329 INFO L93 Difference]: Finished difference Result 233 states and 346 transitions. [2024-11-12 01:28:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 01:28:12,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-11-12 01:28:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 01:28:12,335 INFO L225 Difference]: With dead ends: 233 [2024-11-12 01:28:12,335 INFO L226 Difference]: Without dead ends: 132 [2024-11-12 01:28:12,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 01:28:12,336 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 22 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-12 01:28:12,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 195 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-12 01:28:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-12 01:28:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 111. [2024-11-12 01:28:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 69 states have internal predecessors, (87), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-12 01:28:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 167 transitions. [2024-11-12 01:28:12,352 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 167 transitions. Word has length 164 [2024-11-12 01:28:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 01:28:12,353 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 167 transitions. [2024-11-12 01:28:12,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-12 01:28:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 167 transitions. [2024-11-12 01:28:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 01:28:12,355 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 01:28:12,355 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 01:28:12,372 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 (4)] Ended with exit code 0 [2024-11-12 01:28:12,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:28:12,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 01:28:12,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 01:28:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash -132670390, now seen corresponding path program 1 times [2024-11-12 01:28:12,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 01:28:12,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1287910229] [2024-11-12 01:28:12,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 01:28:12,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 01:28:12,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 01:28:12,560 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 01:28:12,561 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 (5)] Waiting until timeout for monitored process [2024-11-12 01:28:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 01:28:12,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-12 01:28:12,980 INFO L279 TraceCheckSpWp]: Computing forward predicates...