./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_fillercode_fillercodesize_ps-cn-10_file-19.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 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:57:00,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:57:00,421 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:57:00,426 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:57:00,427 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:57:00,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:57:00,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:57:00,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:57:00,457 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:57:00,459 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:57:00,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:57:00,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:57:00,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:57:00,462 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:57:00,462 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:57:00,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:57:00,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:57:00,463 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:57:00,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:57:00,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:57:00,464 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:57:00,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:57:00,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:57:00,467 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:57:00,467 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:57:00,467 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:57:00,468 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:57:00,468 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:57:00,468 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:57:00,469 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:57:00,469 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:57:00,469 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:57:00,469 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:57:00,469 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:57:00,470 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:57:00,470 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:57:00,471 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:57:00,471 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:57:00,471 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:57:00,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:57:00,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:57:00,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:57:00,472 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 -> 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 [2024-11-16 12:57:00,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:57:00,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:57:00,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:57:00,753 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:57:00,754 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:57:00,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-11-16 12:57:02,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:57:02,374 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:57:02,374 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-11-16 12:57:02,386 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c903b720/97a87999727a4da7a71f21df72a611cc/FLAG071f8fb75 [2024-11-16 12:57:02,703 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c903b720/97a87999727a4da7a71f21df72a611cc [2024-11-16 12:57:02,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:57:02,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:57:02,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:57:02,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:57:02,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:57:02,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:57:02" (1/1) ... [2024-11-16 12:57:02,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c7c7a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:02, skipping insertion in model container [2024-11-16 12:57:02,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:57:02" (1/1) ... [2024-11-16 12:57:02,742 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:57:02,903 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_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2024-11-16 12:57:03,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:57:03,015 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:57:03,029 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_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2024-11-16 12:57:03,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:57:03,098 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:57:03,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03 WrapperNode [2024-11-16 12:57:03,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:57:03,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:57:03,100 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:57:03,100 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:57:03,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,172 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-16 12:57:03,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:57:03,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:57:03,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:57:03,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:57:03,184 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,189 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,249 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-16 12:57:03,250 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,250 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,266 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,269 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:57:03,288 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:57:03,288 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:57:03,289 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:57:03,289 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (1/1) ... [2024-11-16 12:57:03,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:57:03,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:57:03,321 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-16 12:57:03,324 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-16 12:57:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:57:03,367 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:57:03,368 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:57:03,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:57:03,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:57:03,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:57:03,446 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:57:03,447 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:57:03,839 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 12:57:03,839 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:57:03,863 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:57:03,864 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:57:03,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:57:03 BoogieIcfgContainer [2024-11-16 12:57:03,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:57:03,868 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:57:03,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:57:03,872 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:57:03,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:57:02" (1/3) ... [2024-11-16 12:57:03,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4d3c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:57:03, skipping insertion in model container [2024-11-16 12:57:03,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:03" (2/3) ... [2024-11-16 12:57:03,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4d3c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:57:03, skipping insertion in model container [2024-11-16 12:57:03,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:57:03" (3/3) ... [2024-11-16 12:57:03,875 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-11-16 12:57:03,890 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:57:03,890 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:57:03,948 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:57:03,958 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;@29fde248, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:57:03,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:57:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 12:57:03,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:57:03,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:57:03,978 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:57:03,979 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:57:03,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:57:03,985 INFO L85 PathProgramCache]: Analyzing trace with hash -597713233, now seen corresponding path program 1 times [2024-11-16 12:57:03,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:57:03,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883232993] [2024-11-16 12:57:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:57:03,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:57:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:57:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:57:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:57:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:57:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:57:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:57:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:57:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:57:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:57:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:57:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:57:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:57:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:57:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:57:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:57:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:57:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:57:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:57:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:57:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:57:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:57:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 12:57:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 12:57:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 12:57:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 12:57:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 12:57:04,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 12:57:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-16 12:57:04,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:57:04,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883232993] [2024-11-16 12:57:04,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883232993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:57:04,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:57:04,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:57:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416472940] [2024-11-16 12:57:04,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:57:04,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:57:04,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:57:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:57:04,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:57:04,489 INFO L87 Difference]: Start difference. First operand has 78 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 12:57:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:57:04,520 INFO L93 Difference]: Finished difference Result 148 states and 256 transitions. [2024-11-16 12:57:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:57:04,522 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) Word has length 173 [2024-11-16 12:57:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:57:04,529 INFO L225 Difference]: With dead ends: 148 [2024-11-16 12:57:04,529 INFO L226 Difference]: Without dead ends: 73 [2024-11-16 12:57:04,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 83 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-16 12:57:04,536 INFO L432 NwaCegarLoop]: 110 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, 110 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-16 12:57:04,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:57:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-16 12:57:04,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-16 12:57:04,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 12:57:04,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2024-11-16 12:57:04,641 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 173 [2024-11-16 12:57:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:57:04,645 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2024-11-16 12:57:04,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 12:57:04,646 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2024-11-16 12:57:04,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:57:04,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:57:04,653 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:57:04,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:57:04,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:57:04,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:57:04,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1378422570, now seen corresponding path program 1 times [2024-11-16 12:57:04,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:57:04,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626120670] [2024-11-16 12:57:04,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:57:04,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:57:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:57:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:57:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:57:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:57:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:57:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:57:05,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:57:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:57:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:57:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:57:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:57:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:57:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:57:05,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:57:05,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:57:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:57:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:57:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:57:05,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:57:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:57:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:57:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 12:57:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 12:57:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 12:57:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 12:57:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 12:57:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 12:57:05,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:05,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-16 12:57:05,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:57:05,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626120670] [2024-11-16 12:57:05,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626120670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:57:05,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:57:05,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 12:57:05,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461179210] [2024-11-16 12:57:05,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:57:05,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:57:05,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:57:05,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:57:05,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:57:05,468 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:57:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:57:05,785 INFO L93 Difference]: Finished difference Result 230 states and 347 transitions. [2024-11-16 12:57:05,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 12:57:05,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-11-16 12:57:05,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:57:05,789 INFO L225 Difference]: With dead ends: 230 [2024-11-16 12:57:05,789 INFO L226 Difference]: Without dead ends: 160 [2024-11-16 12:57:05,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:57:05,791 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 85 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:57:05,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 330 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:57:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-16 12:57:05,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 140. [2024-11-16 12:57:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 12:57:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 213 transitions. [2024-11-16 12:57:05,834 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 213 transitions. Word has length 173 [2024-11-16 12:57:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:57:05,835 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 213 transitions. [2024-11-16 12:57:05,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:57:05,835 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 213 transitions. [2024-11-16 12:57:05,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:57:05,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:57:05,838 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:57:05,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:57:05,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:57:05,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:57:05,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1408992917, now seen corresponding path program 1 times [2024-11-16 12:57:05,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:57:05,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301589771] [2024-11-16 12:57:05,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:57:05,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:57:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:57:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:57:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:57:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:57:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:57:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:57:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:57:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:57:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:57:06,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:57:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:57:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:57:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:57:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:57:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:57:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:57:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:57:06,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:57:06,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:57:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:57:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:57:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 12:57:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 12:57:06,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 12:57:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 12:57:06,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 12:57:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 12:57:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-16 12:57:06,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:57:06,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301589771] [2024-11-16 12:57:06,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301589771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:57:06,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:57:06,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:57:06,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963766444] [2024-11-16 12:57:06,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:57:06,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:57:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:57:06,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:57:06,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:57:06,276 INFO L87 Difference]: Start difference. First operand 140 states and 213 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:57:06,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:57:06,366 INFO L93 Difference]: Finished difference Result 347 states and 530 transitions. [2024-11-16 12:57:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:57:06,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-11-16 12:57:06,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:57:06,370 INFO L225 Difference]: With dead ends: 347 [2024-11-16 12:57:06,370 INFO L226 Difference]: Without dead ends: 210 [2024-11-16 12:57:06,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 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-16 12:57:06,373 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 56 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 208 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-16 12:57:06,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 208 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:57:06,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-16 12:57:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2024-11-16 12:57:06,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 122 states have (on average 1.2459016393442623) internal successors, (152), 122 states have internal predecessors, (152), 81 states have call successors, (81), 3 states have call predecessors, (81), 3 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-16 12:57:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 314 transitions. [2024-11-16 12:57:06,434 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 314 transitions. Word has length 173 [2024-11-16 12:57:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:57:06,434 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 314 transitions. [2024-11-16 12:57:06,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:57:06,435 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 314 transitions. [2024-11-16 12:57:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:57:06,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:57:06,440 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:57:06,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:57:06,440 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:57:06,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:57:06,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1914551542, now seen corresponding path program 1 times [2024-11-16 12:57:06,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:57:06,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192962667] [2024-11-16 12:57:06,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:57:06,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:57:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:57:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:57:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:57:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:57:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:57:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:57:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:57:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:57:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:57:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:57:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:57:06,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:57:06,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:57:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:57:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:57:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:57:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 12:57:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 12:57:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 12:57:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 12:57:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:57:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 12:57:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 12:57:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 12:57:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-16 12:57:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:06,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-16 12:57:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:07,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 12:57:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 33 proven. 45 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-16 12:57:07,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:57:07,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192962667] [2024-11-16 12:57:07,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192962667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:57:07,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105320280] [2024-11-16 12:57:07,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:57:07,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:57:07,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:57:07,017 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-16 12:57:07,018 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-16 12:57:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:07,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 12:57:07,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:57:07,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 708 proven. 45 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2024-11-16 12:57:07,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:57:07,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 33 proven. 45 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-16 12:57:07,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105320280] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:57:07,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:57:07,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-16 12:57:07,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833915744] [2024-11-16 12:57:07,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:57:07,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:57:07,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:57:07,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:57:07,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:57:07,852 INFO L87 Difference]: Start difference. First operand 207 states and 314 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-16 12:57:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:57:08,144 INFO L93 Difference]: Finished difference Result 368 states and 545 transitions. [2024-11-16 12:57:08,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 12:57:08,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 173 [2024-11-16 12:57:08,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:57:08,148 INFO L225 Difference]: With dead ends: 368 [2024-11-16 12:57:08,148 INFO L226 Difference]: Without dead ends: 231 [2024-11-16 12:57:08,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 395 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-16 12:57:08,150 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 225 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:57:08,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 172 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:57:08,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-16 12:57:08,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2024-11-16 12:57:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 131 states have (on average 1.213740458015267) internal successors, (159), 131 states have internal predecessors, (159), 81 states have call successors, (81), 6 states have call predecessors, (81), 6 states have return successors, (81), 81 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-16 12:57:08,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 321 transitions. [2024-11-16 12:57:08,188 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 321 transitions. Word has length 173 [2024-11-16 12:57:08,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:57:08,189 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 321 transitions. [2024-11-16 12:57:08,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-16 12:57:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 321 transitions. [2024-11-16 12:57:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:57:08,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:57:08,191 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:57:08,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 12:57:08,392 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-16 12:57:08,393 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:57:08,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:57:08,393 INFO L85 PathProgramCache]: Analyzing trace with hash -171741207, now seen corresponding path program 1 times [2024-11-16 12:57:08,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:57:08,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443839526] [2024-11-16 12:57:08,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:57:08,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:57:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:57:08,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:57:08,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:57:08,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:57:08,664 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:57:08,665 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:57:08,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:57:08,670 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-16 12:57:08,788 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:57:08,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:57:08 BoogieIcfgContainer [2024-11-16 12:57:08,792 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:57:08,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:57:08,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:57:08,793 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:57:08,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:57:03" (3/4) ... [2024-11-16 12:57:08,795 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:57:08,796 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:57:08,797 INFO L158 Benchmark]: Toolchain (without parser) took 6089.83ms. Allocated memory was 163.6MB in the beginning and 268.4MB in the end (delta: 104.9MB). Free memory was 92.3MB in the beginning and 181.2MB in the end (delta: -88.9MB). Peak memory consumption was 16.7MB. Max. memory is 16.1GB. [2024-11-16 12:57:08,797 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 163.6MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:57:08,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.27ms. Allocated memory is still 163.6MB. Free memory was 92.3MB in the beginning and 74.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 12:57:08,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.94ms. Allocated memory is still 163.6MB. Free memory was 74.8MB in the beginning and 69.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 12:57:08,801 INFO L158 Benchmark]: Boogie Preprocessor took 112.96ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 69.0MB in the beginning and 191.0MB in the end (delta: -122.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-16 12:57:08,801 INFO L158 Benchmark]: IcfgBuilder took 577.05ms. Allocated memory is still 222.3MB. Free memory was 191.0MB in the beginning and 161.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 12:57:08,801 INFO L158 Benchmark]: TraceAbstraction took 4923.45ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 161.6MB in the beginning and 181.2MB in the end (delta: -19.5MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. [2024-11-16 12:57:08,801 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 268.4MB. Free memory is still 181.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:57:08,803 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.13ms. Allocated memory is still 163.6MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.27ms. Allocated memory is still 163.6MB. Free memory was 92.3MB in the beginning and 74.8MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.94ms. Allocated memory is still 163.6MB. Free memory was 74.8MB in the beginning and 69.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.96ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 69.0MB in the beginning and 191.0MB in the end (delta: -122.0MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * IcfgBuilder took 577.05ms. Allocated memory is still 222.3MB. Free memory was 191.0MB in the beginning and 161.6MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4923.45ms. Allocated memory was 222.3MB in the beginning and 268.4MB in the end (delta: 46.1MB). Free memory was 161.6MB in the beginning and 181.2MB in the end (delta: -19.5MB). Peak memory consumption was 26.6MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 268.4MB. Free memory is still 181.2MB. 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 150, overapproximation of someUnaryDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 150, overapproximation of someUnaryFLOAToperation at line 70, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] unsigned char var_1_2 = 128; [L24] unsigned char var_1_3 = 64; [L25] signed short int var_1_6 = -16; [L26] unsigned short int var_1_7 = 56838; [L27] unsigned short int var_1_8 = 24612; [L28] signed short int var_1_9 = 20013; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] unsigned char var_1_13 = 0; [L32] signed short int var_1_14 = 50; [L33] unsigned char var_1_15 = 0; [L34] signed short int var_1_19 = 100; [L35] double var_1_21 = 3.5; [L36] signed short int var_1_23 = -128; [L37] float var_1_24 = 10.2; [L38] float var_1_25 = 8.6; [L39] float var_1_26 = 32.7; [L40] float var_1_27 = 16.25; [L41] float var_1_28 = 8.875; [L42] unsigned short int var_1_29 = 256; [L43] double var_1_30 = 2.75; [L44] double var_1_31 = 0.0; [L45] unsigned char var_1_32 = 8; [L46] unsigned char var_1_33 = 100; [L47] double var_1_34 = 0.19999999999999996; [L48] signed char var_1_35 = -32; [L49] signed char var_1_36 = -1; [L50] signed char var_1_37 = -8; [L51] unsigned char last_1_var_1_15 = 0; VAL [isInitial=0, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=128, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L154] isInitial = 1 [L155] FCALL initially() [L156] COND TRUE 1 [L157] CALL updateLastVariables() [L147] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=128, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L157] RET updateLastVariables() [L158] CALL updateVariables() [L102] var_1_2 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L103] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L104] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L104] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=64, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L105] var_1_3 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L106] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L107] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L107] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=56838, var_1_8=24612, var_1_9=20013] [L108] var_1_7 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_7 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L109] RET assume_abort_if_not(var_1_7 >= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L110] CALL assume_abort_if_not(var_1_7 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L110] RET assume_abort_if_not(var_1_7 <= 65535) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=24612, var_1_9=20013] [L111] var_1_8 = __VERIFIER_nondet_ushort() [L112] CALL assume_abort_if_not(var_1_8 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L112] RET assume_abort_if_not(var_1_8 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L113] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L113] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=20013] [L114] var_1_9 = __VERIFIER_nondet_short() [L115] CALL assume_abort_if_not(var_1_9 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L115] RET assume_abort_if_not(var_1_9 >= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L116] CALL assume_abort_if_not(var_1_9 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L116] RET assume_abort_if_not(var_1_9 <= 32766) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L117] var_1_12 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L118] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L119] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L119] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L120] var_1_13 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L121] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L122] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L122] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_21=7/2, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L123] var_1_21 = __VERIFIER_nondet_double() [L124] CALL assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L124] RET assume_abort_if_not((var_1_21 >= -922337.2036854776000e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L125] CALL assume_abort_if_not(var_1_21 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L125] RET assume_abort_if_not(var_1_21 != 0.0F) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=-128, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L126] var_1_23 = __VERIFIER_nondet_short() [L127] CALL assume_abort_if_not(var_1_23 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L127] RET assume_abort_if_not(var_1_23 >= -16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L128] CALL assume_abort_if_not(var_1_23 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L128] RET assume_abort_if_not(var_1_23 <= 16383) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_25=43/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L129] var_1_25 = __VERIFIER_nondet_float() [L130] CALL assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L130] RET assume_abort_if_not((var_1_25 >= -922337.2036854765600e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 9223372.036854765600e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_26=327/10, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L131] var_1_26 = __VERIFIER_nondet_float() [L132] CALL assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L132] RET assume_abort_if_not((var_1_26 >= -922337.2036854765600e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 9223372.036854765600e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_27=65/4, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L133] var_1_27 = __VERIFIER_nondet_float() [L134] CALL assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L134] RET assume_abort_if_not((var_1_27 >= 0.0F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_28=71/8, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L135] var_1_28 = __VERIFIER_nondet_float() [L136] CALL assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L136] RET assume_abort_if_not((var_1_28 >= 0.0F && var_1_28 <= -1.0e-20F) || (var_1_28 <= 9223372.036854765600e+12F && var_1_28 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_31=0, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L137] var_1_31 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L138] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=100, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L139] var_1_33 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L140] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L141] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L141] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-8, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L142] var_1_37 = __VERIFIER_nondet_char() [L143] CALL assume_abort_if_not(var_1_37 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L143] RET assume_abort_if_not(var_1_37 >= -127) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L144] CALL assume_abort_if_not(var_1_37 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L144] RET assume_abort_if_not(var_1_37 <= 126) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=11/4, var_1_32=8, var_1_33=-2, var_1_34=4999999999999999/25000000000000000, var_1_35=-32, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L158] RET updateVariables() [L159] CALL step() [L55] var_1_30 = ((((var_1_31) < 0 ) ? -(var_1_31) : (var_1_31))) [L56] var_1_32 = var_1_33 [L57] var_1_34 = var_1_31 [L58] var_1_35 = -1 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L59] COND FALSE !(var_1_31 <= var_1_34) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L64] COND FALSE !(\read(last_1_var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=51/5, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L67] COND FALSE !(\read(var_1_10)) [L70] var_1_24 = ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=0, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L72] COND TRUE (- var_1_24) == (var_1_24 + var_1_24) [L73] var_1_15 = var_1_12 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=100, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L75] COND FALSE !(var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) [L82] var_1_19 = var_1_2 VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=256, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L84] COND TRUE var_1_24 != var_1_24 [L85] var_1_29 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L87] signed long int stepLocal_1 = var_1_7 - (var_1_8 - var_1_2); VAL [isInitial=1, last_1_var_1_15=0, stepLocal_1=16511, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-16, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L88] COND TRUE stepLocal_1 >= var_1_29 [L89] var_1_6 = (var_1_3 - (var_1_9 - var_1_2)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L91] COND FALSE !(\read(var_1_15)) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L94] signed long int stepLocal_0 = var_1_2 - var_1_3; VAL [isInitial=1, last_1_var_1_15=0, stepLocal_0=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=-64, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L95] COND TRUE stepLocal_0 <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6))) [L96] var_1_1 = ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L159] RET step() [L160] CALL, EXPR property() [L150-L151] return (((((((((var_1_2 - var_1_3) <= ((((var_1_29) > (var_1_6)) ? (var_1_29) : (var_1_6)))) ? (var_1_1 == ((signed long int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : (var_1_1 == ((signed long int) var_1_2))) && (((var_1_7 - (var_1_8 - var_1_2)) >= var_1_29) ? (var_1_6 == ((signed short int) (var_1_3 - (var_1_9 - var_1_2)))) : 1)) && (last_1_var_1_15 ? (var_1_10 == ((unsigned char) (var_1_12 || var_1_13))) : 1)) && (var_1_15 ? (var_1_14 == ((signed short int) (((((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) < (var_1_9)) ? ((((((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) < 0 ) ? -((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2))) : ((((var_1_3) > (var_1_2)) ? (var_1_3) : (var_1_2)))))) : (var_1_9))))) : 1)) && (((- var_1_24) == (var_1_24 + var_1_24)) ? (var_1_15 == ((unsigned char) var_1_12)) : 1)) && ((var_1_24 == ((((((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) > ((var_1_24 / var_1_21))) ? (((((3.3) > (var_1_24)) ? (3.3) : (var_1_24)))) : ((var_1_24 / var_1_21))))) ? (var_1_10 ? (var_1_19 == ((signed short int) (var_1_3 + ((((var_1_2) < (var_1_23)) ? (var_1_2) : (var_1_23)))))) : (var_1_19 == ((signed short int) (var_1_3 - 8)))) : (var_1_19 == ((signed short int) var_1_2)))) && (var_1_10 ? (var_1_24 == ((float) ((((var_1_25) > (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))) ? (var_1_25) : (((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26)))))))) : (var_1_24 == ((float) ((((var_1_27 - var_1_28) < 0 ) ? -(var_1_27 - var_1_28) : (var_1_27 - var_1_28))))))) && ((var_1_24 != var_1_24) ? (var_1_29 == ((unsigned short int) ((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L160] RET, EXPR property() [L160] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=0, var_1_10=0, var_1_12=-256, var_1_13=0, var_1_14=50, var_1_15=-256, var_1_19=127, var_1_1=127, var_1_23=127, var_1_24=56844, var_1_29=127, var_1_2=127, var_1_30=56843, var_1_31=56843, var_1_32=-2, var_1_33=-2, var_1_34=56843, var_1_35=-1, var_1_36=-1, var_1_37=-127, var_1_3=127, var_1_6=-32512, var_1_7=32767, var_1_8=16383, var_1_9=32766] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 5, TraceHistogramMax: 27, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 366 mSDsluCounter, 820 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 402 mSDsCounter, 208 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 177 IncrementalHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 208 mSolverCounterUnsat, 418 mSDtfsCounter, 177 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 610 GetRequests, 591 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=4, InterpolantAutomatonStates: 19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 35 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1038 NumberOfCodeBlocks, 1038 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1032 ConstructedInterpolants, 0 QuantifiedInterpolants, 2654 SizeOfPredicates, 2 NumberOfNonLiveVariables, 402 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 8289/8424 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-16 12:57:08,840 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_fillercode_fillercodesize_ps-cn-10_file-19.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 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:57:11,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:57:11,106 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:57:11,113 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:57:11,114 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:57:11,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:57:11,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:57:11,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:57:11,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:57:11,146 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:57:11,146 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:57:11,146 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:57:11,147 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:57:11,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:57:11,147 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:57:11,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:57:11,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:57:11,149 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:57:11,150 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:57:11,150 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:57:11,150 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:57:11,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:57:11,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:57:11,151 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:57:11,152 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:57:11,152 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:57:11,152 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:57:11,152 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:57:11,153 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:57:11,153 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:57:11,153 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:57:11,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:57:11,154 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:57:11,155 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:57:11,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:57:11,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:57:11,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:57:11,156 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:57:11,156 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:57:11,156 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:57:11,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:57:11,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:57:11,157 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:57:11,157 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:57:11,157 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 -> 8456d7b7b6cba2e1f4cc22023658f7dd768509fc86decaacd3d3922e32c6df21 [2024-11-16 12:57:11,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:57:11,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:57:11,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:57:11,515 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:57:11,516 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:57:11,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-11-16 12:57:13,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:57:13,250 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:57:13,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-11-16 12:57:13,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87cc8d74/c6455e0bf4a7494889dc4716dd7e50f9/FLAG99de7b144 [2024-11-16 12:57:13,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87cc8d74/c6455e0bf4a7494889dc4716dd7e50f9 [2024-11-16 12:57:13,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:57:13,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:57:13,286 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:57:13,286 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:57:13,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:57:13,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7832fb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13, skipping insertion in model container [2024-11-16 12:57:13,293 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,326 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:57:13,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_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2024-11-16 12:57:13,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:57:13,600 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:57:13,615 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_fillercode_fillercodesize_ps-cn-10_file-19.i[915,928] [2024-11-16 12:57:13,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:57:13,689 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:57:13,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13 WrapperNode [2024-11-16 12:57:13,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:57:13,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:57:13,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:57:13,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:57:13,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,714 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,754 INFO L138 Inliner]: procedures = 27, calls = 40, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-16 12:57:13,755 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:57:13,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:57:13,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:57:13,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:57:13,773 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,812 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-16 12:57:13,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,831 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,839 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:57:13,851 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:57:13,851 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:57:13,851 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:57:13,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (1/1) ... [2024-11-16 12:57:13,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:57:13,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:57:13,891 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-16 12:57:13,894 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-16 12:57:13,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:57:13,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:57:13,939 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:57:13,939 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:57:13,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:57:13,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:57:14,041 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:57:14,044 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:57:28,193 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-16 12:57:28,194 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:57:28,206 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:57:28,207 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:57:28,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:57:28 BoogieIcfgContainer [2024-11-16 12:57:28,208 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:57:28,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:57:28,210 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:57:28,213 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:57:28,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:57:13" (1/3) ... [2024-11-16 12:57:28,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a64752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:57:28, skipping insertion in model container [2024-11-16 12:57:28,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:57:13" (2/3) ... [2024-11-16 12:57:28,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a64752 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:57:28, skipping insertion in model container [2024-11-16 12:57:28,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:57:28" (3/3) ... [2024-11-16 12:57:28,215 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-19.i [2024-11-16 12:57:28,228 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:57:28,228 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:57:28,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:57:28,296 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;@1f34e101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:57:28,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:57:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 12:57:28,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:57:28,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:57:28,317 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:57:28,318 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:57:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:57:28,323 INFO L85 PathProgramCache]: Analyzing trace with hash -597713233, now seen corresponding path program 1 times [2024-11-16 12:57:28,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:57:28,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2140756712] [2024-11-16 12:57:28,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:57:28,341 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-16 12:57:28,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:57:28,347 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-16 12:57:28,348 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-16 12:57:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:29,295 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:57:29,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:57:29,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 932 trivial. 0 not checked. [2024-11-16 12:57:29,367 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:57:29,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:57:29,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2140756712] [2024-11-16 12:57:29,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2140756712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:57:29,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:57:29,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:57:29,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918869237] [2024-11-16 12:57:29,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:57:29,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:57:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:57:29,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:57:29,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:57:29,410 INFO L87 Difference]: Start difference. First operand has 78 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 49 states have internal predecessors, (64), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 12:57:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:57:29,449 INFO L93 Difference]: Finished difference Result 148 states and 256 transitions. [2024-11-16 12:57:29,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:57:29,452 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 173 [2024-11-16 12:57:29,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:57:29,460 INFO L225 Difference]: With dead ends: 148 [2024-11-16 12:57:29,461 INFO L226 Difference]: Without dead ends: 73 [2024-11-16 12:57:29,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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-16 12:57:29,471 INFO L432 NwaCegarLoop]: 110 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, 110 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-16 12:57:29,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:57:29,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-16 12:57:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-16 12:57:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 27 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-16 12:57:29,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2024-11-16 12:57:29,530 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 173 [2024-11-16 12:57:29,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:57:29,531 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2024-11-16 12:57:29,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-11-16 12:57:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2024-11-16 12:57:29,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:57:29,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:57:29,538 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:57:29,566 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-16 12:57:29,739 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-16 12:57:29,740 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:57:29,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:57:29,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1378422570, now seen corresponding path program 1 times [2024-11-16 12:57:29,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:57:29,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1800363664] [2024-11-16 12:57:29,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:57:29,744 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-16 12:57:29,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:57:29,747 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-16 12:57:29,755 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-16 12:57:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:57:30,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 12:57:30,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:57:36,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-16 12:57:36,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:57:36,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:57:36,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1800363664] [2024-11-16 12:57:36,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1800363664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:57:36,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:57:36,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:57:36,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50408231] [2024-11-16 12:57:36,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:57:36,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 12:57:36,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:57:36,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 12:57:36,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 12:57:36,378 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:57:41,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:57:45,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:57:49,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:57:53,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:57:57,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:58:01,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:58:05,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:58:05,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:05,951 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2024-11-16 12:58:06,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 12:58:06,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-11-16 12:58:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:06,117 INFO L225 Difference]: With dead ends: 243 [2024-11-16 12:58:06,117 INFO L226 Difference]: Without dead ends: 173 [2024-11-16 12:58:06,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:58:06,120 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 96 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 59 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:06,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 344 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 8 Invalid, 7 Unknown, 0 Unchecked, 29.4s Time] [2024-11-16 12:58:06,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-16 12:58:06,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 140. [2024-11-16 12:58:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 83 states have internal predecessors, (105), 54 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 12:58:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 213 transitions. [2024-11-16 12:58:06,165 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 213 transitions. Word has length 173 [2024-11-16 12:58:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:06,167 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 213 transitions. [2024-11-16 12:58:06,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:58:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 213 transitions. [2024-11-16 12:58:06,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:58:06,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:06,170 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:58:06,192 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-16 12:58:06,370 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-16 12:58:06,371 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:06,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1408992917, now seen corresponding path program 1 times [2024-11-16 12:58:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:58:06,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1722114454] [2024-11-16 12:58:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:06,373 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-16 12:58:06,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:58:06,395 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-16 12:58:06,396 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-16 12:58:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:07,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 12:58:07,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:58:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-16 12:58:13,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:58:13,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:58:13,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1722114454] [2024-11-16 12:58:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1722114454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:13,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:58:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31191387] [2024-11-16 12:58:13,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:13,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:58:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:58:13,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:58:13,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:58:13,059 INFO L87 Difference]: Start difference. First operand 140 states and 213 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:58:17,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:58:22,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-16 12:58:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:58:22,155 INFO L93 Difference]: Finished difference Result 414 states and 633 transitions. [2024-11-16 12:58:22,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:58:22,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) Word has length 173 [2024-11-16 12:58:22,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:58:22,319 INFO L225 Difference]: With dead ends: 414 [2024-11-16 12:58:22,320 INFO L226 Difference]: Without dead ends: 277 [2024-11-16 12:58:22,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:58:22,322 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 26 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:58:22,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 209 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2024-11-16 12:58:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-16 12:58:22,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 274. [2024-11-16 12:58:22,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 161 states have (on average 1.2484472049689441) internal successors, (201), 161 states have internal predecessors, (201), 108 states have call successors, (108), 4 states have call predecessors, (108), 4 states have return successors, (108), 108 states have call predecessors, (108), 108 states have call successors, (108) [2024-11-16 12:58:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 417 transitions. [2024-11-16 12:58:22,376 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 417 transitions. Word has length 173 [2024-11-16 12:58:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:58:22,377 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 417 transitions. [2024-11-16 12:58:22,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 2 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:58:22,378 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 417 transitions. [2024-11-16 12:58:22,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-16 12:58:22,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:58:22,380 INFO L215 NwaCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:58:22,409 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 (4)] Forceful destruction successful, exit code 0 [2024-11-16 12:58:22,581 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-16 12:58:22,581 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:58:22,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:58:22,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1914551542, now seen corresponding path program 1 times [2024-11-16 12:58:22,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:58:22,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1084687122] [2024-11-16 12:58:22,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:58:22,583 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-16 12:58:22,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:58:22,585 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-16 12:58:22,587 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-16 12:58:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:58:23,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 12:58:23,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:58:23,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1404 trivial. 0 not checked. [2024-11-16 12:58:23,750 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:58:23,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:58:23,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1084687122] [2024-11-16 12:58:23,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1084687122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:58:23,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:58:23,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:58:23,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098396650] [2024-11-16 12:58:23,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:58:23,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:58:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:58:23,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:58:23,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:58:23,757 INFO L87 Difference]: Start difference. First operand 274 states and 417 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 1 states have call predecessors, (27), 1 states have call successors, (27) [2024-11-16 12:58:26,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 12:58:28,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result VALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-16 12:58:32,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.45s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0]