./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.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 42c6423785198dd4a043b6ffb8b15bc58abdd425ee3b16bee994e5bca051a506 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:23:09,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:23:09,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:23:09,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:23:09,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:23:09,510 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:23:09,511 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:23:09,511 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:23:09,512 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:23:09,512 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:23:09,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:23:09,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:23:09,514 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:23:09,514 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:23:09,514 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:23:09,515 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:23:09,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:23:09,518 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:23:09,518 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:23:09,518 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:23:09,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:23:09,521 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:23:09,522 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:23:09,522 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:23:09,522 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:23:09,522 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:23:09,523 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:23:09,523 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:23:09,523 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:23:09,524 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:23:09,524 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:23:09,524 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:23:09,524 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:23:09,525 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:23:09,525 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:23:09,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:23:09,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:23:09,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:23:09,527 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:23:09,527 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:23:09,527 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:23:09,527 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:23:09,528 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 -> 42c6423785198dd4a043b6ffb8b15bc58abdd425ee3b16bee994e5bca051a506 [2024-10-24 05:23:09,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:23:09,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:23:09,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:23:09,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:23:09,816 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:23:09,817 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i [2024-10-24 05:23:11,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:23:11,512 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:23:11,513 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i [2024-10-24 05:23:11,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27eab24b1/b9d1da36cf364dbb97cdd51d7b4f6dde/FLAGfd35dae41 [2024-10-24 05:23:11,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27eab24b1/b9d1da36cf364dbb97cdd51d7b4f6dde [2024-10-24 05:23:11,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:23:11,539 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:23:11,540 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:23:11,540 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:23:11,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:23:11,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:11,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4363ac01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11, skipping insertion in model container [2024-10-24 05:23:11,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:11,572 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:23:11,745 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i[913,926] [2024-10-24 05:23:11,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:23:11,818 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:23:11,828 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i[913,926] [2024-10-24 05:23:11,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:23:11,876 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:23:11,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11 WrapperNode [2024-10-24 05:23:11,877 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:23:11,878 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:23:11,878 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:23:11,878 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:23:11,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:11,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:11,943 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 235 [2024-10-24 05:23:11,946 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:23:11,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:23:11,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:23:11,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:23:11,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:11,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:11,965 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:11,997 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:23:11,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:11,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:12,013 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:12,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:12,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:12,022 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:12,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:23:12,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:23:12,026 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:23:12,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:23:12,027 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (1/1) ... [2024-10-24 05:23:12,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:23:12,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:23:12,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:23:12,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:23:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:23:12,116 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:23:12,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:23:12,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:23:12,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:23:12,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:23:12,194 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:23:12,196 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:23:12,669 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-24 05:23:12,669 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:23:12,718 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:23:12,718 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:23:12,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:23:12 BoogieIcfgContainer [2024-10-24 05:23:12,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:23:12,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:23:12,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:23:12,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:23:12,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:23:11" (1/3) ... [2024-10-24 05:23:12,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477133c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:23:12, skipping insertion in model container [2024-10-24 05:23:12,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:11" (2/3) ... [2024-10-24 05:23:12,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@477133c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:23:12, skipping insertion in model container [2024-10-24 05:23:12,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:23:12" (3/3) ... [2024-10-24 05:23:12,730 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-65.i [2024-10-24 05:23:12,746 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:23:12,746 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:23:12,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:23:12,822 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;@69f802b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:23:12,823 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:23:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:23:12,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-24 05:23:12,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:12,845 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:12,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:12,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:12,853 INFO L85 PathProgramCache]: Analyzing trace with hash 509834682, now seen corresponding path program 1 times [2024-10-24 05:23:12,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:23:12,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744700432] [2024-10-24 05:23:12,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:12,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:23:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:23:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:23:15,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:23:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:23:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:23:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:23:15,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:23:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:23:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:23:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:23:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:23:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:23:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:23:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:23:15,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:23:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:23:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:23:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:23:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:23:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:23:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:23:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:23:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:23:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:23:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:23:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:23:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:23:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:23:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:23:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 05:23:15,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 05:23:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 05:23:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 05:23:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:23:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:23:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:23:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:23:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:23:15,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744700432] [2024-10-24 05:23:15,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744700432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:23:15,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:23:15,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:23:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585780863] [2024-10-24 05:23:15,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:23:15,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:23:15,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:23:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:23:15,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:23:15,341 INFO L87 Difference]: Start difference. First operand has 98 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:23:15,843 INFO L93 Difference]: Finished difference Result 227 states and 402 transitions. [2024-10-24 05:23:15,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:23:15,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 217 [2024-10-24 05:23:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:23:15,861 INFO L225 Difference]: With dead ends: 227 [2024-10-24 05:23:15,861 INFO L226 Difference]: Without dead ends: 130 [2024-10-24 05:23:15,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:23:15,873 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 42 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:23:15,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 435 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 05:23:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-24 05:23:15,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2024-10-24 05:23:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.44) internal successors, (108), 75 states have internal predecessors, (108), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:23:15,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 180 transitions. [2024-10-24 05:23:15,933 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 180 transitions. Word has length 217 [2024-10-24 05:23:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:23:15,935 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 180 transitions. [2024-10-24 05:23:15,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 180 transitions. [2024-10-24 05:23:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-10-24 05:23:15,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:15,941 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:15,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:23:15,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:15,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:15,942 INFO L85 PathProgramCache]: Analyzing trace with hash -770028996, now seen corresponding path program 1 times [2024-10-24 05:23:15,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:23:15,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751863069] [2024-10-24 05:23:15,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:15,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:23:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:23:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:23:18,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:23:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:23:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:23:18,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:23:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:23:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:23:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:23:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:23:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:23:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:23:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:23:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:23:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:23:18,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:23:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:23:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:23:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:23:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:23:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:23:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:23:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:23:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:23:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:23:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:23:18,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:23:18,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:23:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:23:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 05:23:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 05:23:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 05:23:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 05:23:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:23:18,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:23:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:23:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:18,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:23:18,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:23:18,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751863069] [2024-10-24 05:23:18,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751863069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:23:18,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:23:18,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:23:18,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122428034] [2024-10-24 05:23:18,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:23:18,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:23:18,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:23:18,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:23:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:23:18,695 INFO L87 Difference]: Start difference. First operand 113 states and 180 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:23:19,212 INFO L93 Difference]: Finished difference Result 317 states and 503 transitions. [2024-10-24 05:23:19,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:23:19,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 217 [2024-10-24 05:23:19,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:23:19,219 INFO L225 Difference]: With dead ends: 317 [2024-10-24 05:23:19,219 INFO L226 Difference]: Without dead ends: 205 [2024-10-24 05:23:19,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:23:19,223 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 88 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:23:19,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 447 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 05:23:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-10-24 05:23:19,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 120. [2024-10-24 05:23:19,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 82 states have (on average 1.475609756097561) internal successors, (121), 82 states have internal predecessors, (121), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:23:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 193 transitions. [2024-10-24 05:23:19,250 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 193 transitions. Word has length 217 [2024-10-24 05:23:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:23:19,251 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 193 transitions. [2024-10-24 05:23:19,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 193 transitions. [2024-10-24 05:23:19,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-24 05:23:19,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:19,260 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:19,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:23:19,260 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:19,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:19,261 INFO L85 PathProgramCache]: Analyzing trace with hash 835464468, now seen corresponding path program 1 times [2024-10-24 05:23:19,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:23:19,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839692611] [2024-10-24 05:23:19,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:19,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:23:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:23:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:23:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:23:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:23:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:23:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:23:25,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:23:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:23:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:23:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:23:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:23:25,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:23:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:23:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:23:25,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:23:25,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:23:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:23:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:23:25,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:23:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:23:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:23:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:23:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:23:25,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:23:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:23:25,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:23:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:23:25,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:23:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:23:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 05:23:25,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 05:23:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 05:23:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 05:23:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:23:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:23:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:23:25,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:25,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:23:25,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:23:25,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839692611] [2024-10-24 05:23:25,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839692611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:23:25,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:23:25,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:23:25,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652921593] [2024-10-24 05:23:25,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:23:25,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:23:25,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:23:25,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:23:25,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:23:25,196 INFO L87 Difference]: Start difference. First operand 120 states and 193 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:25,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:23:25,656 INFO L93 Difference]: Finished difference Result 308 states and 487 transitions. [2024-10-24 05:23:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:23:25,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 218 [2024-10-24 05:23:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:23:25,661 INFO L225 Difference]: With dead ends: 308 [2024-10-24 05:23:25,661 INFO L226 Difference]: Without dead ends: 189 [2024-10-24 05:23:25,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:23:25,667 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 148 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:23:25,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 430 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 05:23:25,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-24 05:23:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 119. [2024-10-24 05:23:25,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 81 states have internal predecessors, (117), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:23:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2024-10-24 05:23:25,684 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 218 [2024-10-24 05:23:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:23:25,685 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2024-10-24 05:23:25,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2024-10-24 05:23:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-10-24 05:23:25,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:25,688 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:25,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:23:25,689 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:25,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash -175652782, now seen corresponding path program 1 times [2024-10-24 05:23:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:23:25,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281123518] [2024-10-24 05:23:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:23:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:23:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:23:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:23:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:23:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:23:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:23:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:23:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:23:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:23:28,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:23:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:23:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:23:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:23:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:23:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:23:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:23:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:23:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:23:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:23:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:23:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:23:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:23:28,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:23:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:23:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:23:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:23:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:23:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:23:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:23:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 05:23:28,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 05:23:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 05:23:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 05:23:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:23:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:23:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:23:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:23:28,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:23:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281123518] [2024-10-24 05:23:28,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281123518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:23:28,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:23:28,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 05:23:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074402821] [2024-10-24 05:23:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:23:28,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 05:23:28,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:23:28,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 05:23:28,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 05:23:28,395 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:23:28,855 INFO L93 Difference]: Finished difference Result 292 states and 455 transitions. [2024-10-24 05:23:28,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 05:23:28,856 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 218 [2024-10-24 05:23:28,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:23:28,858 INFO L225 Difference]: With dead ends: 292 [2024-10-24 05:23:28,858 INFO L226 Difference]: Without dead ends: 174 [2024-10-24 05:23:28,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:23:28,860 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 86 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:23:28,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 335 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 05:23:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-24 05:23:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 103. [2024-10-24 05:23:28,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 65 states have internal predecessors, (90), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:23:28,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 162 transitions. [2024-10-24 05:23:28,881 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 162 transitions. Word has length 218 [2024-10-24 05:23:28,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:23:28,882 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 162 transitions. [2024-10-24 05:23:28,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 162 transitions. [2024-10-24 05:23:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 05:23:28,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:28,887 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:28,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:23:28,888 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:28,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:28,888 INFO L85 PathProgramCache]: Analyzing trace with hash -596933057, now seen corresponding path program 1 times [2024-10-24 05:23:28,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:23:28,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340492396] [2024-10-24 05:23:28,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:28,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:23:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:23:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:23:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:23:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:23:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:23:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:23:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:23:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:23:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:23:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:23:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:23:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:23:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 05:23:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:23:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 05:23:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 05:23:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 05:23:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 05:23:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 05:23:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 05:23:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 05:23:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 05:23:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 05:23:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 05:23:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 05:23:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 05:23:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 05:23:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 05:23:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-24 05:23:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 05:23:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 05:23:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 05:23:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 05:23:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 05:23:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 05:23:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-24 05:23:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-24 05:23:29,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:23:29,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340492396] [2024-10-24 05:23:29,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340492396] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:23:29,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:23:29,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:23:29,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357344680] [2024-10-24 05:23:29,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:23:29,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:23:29,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:23:29,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:23:29,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:23:29,282 INFO L87 Difference]: Start difference. First operand 103 states and 162 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:23:29,606 INFO L93 Difference]: Finished difference Result 355 states and 555 transitions. [2024-10-24 05:23:29,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:23:29,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 219 [2024-10-24 05:23:29,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:23:29,609 INFO L225 Difference]: With dead ends: 355 [2024-10-24 05:23:29,609 INFO L226 Difference]: Without dead ends: 253 [2024-10-24 05:23:29,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:23:29,613 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 178 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:23:29,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 404 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:23:29,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-24 05:23:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 248. [2024-10-24 05:23:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 164 states have (on average 1.4024390243902438) internal successors, (230), 165 states have internal predecessors, (230), 80 states have call successors, (80), 3 states have call predecessors, (80), 3 states have return successors, (80), 79 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-24 05:23:29,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 390 transitions. [2024-10-24 05:23:29,667 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 390 transitions. Word has length 219 [2024-10-24 05:23:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:23:29,670 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 390 transitions. [2024-10-24 05:23:29,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-24 05:23:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 390 transitions. [2024-10-24 05:23:29,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-24 05:23:29,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:29,672 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:29,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:23:29,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:29,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:29,673 INFO L85 PathProgramCache]: Analyzing trace with hash -989960067, now seen corresponding path program 1 times [2024-10-24 05:23:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:23:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807815528] [2024-10-24 05:23:29,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:23:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:23:29,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 05:23:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 05:23:29,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 05:23:29,894 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 05:23:29,895 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 05:23:29,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 05:23:29,903 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 05:23:30,049 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 05:23:30,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 05:23:30 BoogieIcfgContainer [2024-10-24 05:23:30,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 05:23:30,055 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 05:23:30,055 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 05:23:30,056 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 05:23:30,057 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:23:12" (3/4) ... [2024-10-24 05:23:30,058 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 05:23:30,060 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 05:23:30,060 INFO L158 Benchmark]: Toolchain (without parser) took 18520.96ms. Allocated memory was 176.2MB in the beginning and 780.1MB in the end (delta: 604.0MB). Free memory was 119.2MB in the beginning and 466.4MB in the end (delta: -347.2MB). Peak memory consumption was 258.8MB. Max. memory is 16.1GB. [2024-10-24 05:23:30,060 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:23:30,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.32ms. Allocated memory is still 176.2MB. Free memory was 118.7MB in the beginning and 102.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 05:23:30,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.04ms. Allocated memory is still 176.2MB. Free memory was 102.4MB in the beginning and 98.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:23:30,061 INFO L158 Benchmark]: Boogie Preprocessor took 78.82ms. Allocated memory is still 176.2MB. Free memory was 98.2MB in the beginning and 94.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 05:23:30,061 INFO L158 Benchmark]: RCFGBuilder took 692.77ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 94.0MB in the beginning and 220.2MB in the end (delta: -126.2MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2024-10-24 05:23:30,062 INFO L158 Benchmark]: TraceAbstraction took 17332.67ms. Allocated memory was 260.0MB in the beginning and 780.1MB in the end (delta: 520.1MB). Free memory was 219.1MB in the beginning and 466.4MB in the end (delta: -247.3MB). Peak memory consumption was 272.8MB. Max. memory is 16.1GB. [2024-10-24 05:23:30,062 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 780.1MB. Free memory is still 466.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 05:23:30,064 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.17ms. Allocated memory is still 176.2MB. Free memory is still 136.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.32ms. Allocated memory is still 176.2MB. Free memory was 118.7MB in the beginning and 102.4MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.04ms. Allocated memory is still 176.2MB. Free memory was 102.4MB in the beginning and 98.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.82ms. Allocated memory is still 176.2MB. Free memory was 98.2MB in the beginning and 94.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 692.77ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 94.0MB in the beginning and 220.2MB in the end (delta: -126.2MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. * TraceAbstraction took 17332.67ms. Allocated memory was 260.0MB in the beginning and 780.1MB in the end (delta: 520.1MB). Free memory was 219.1MB in the beginning and 466.4MB in the end (delta: -247.3MB). Peak memory consumption was 272.8MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 780.1MB. Free memory is still 466.4MB. 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 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryArithmeticDOUBLEoperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 4; [L23] unsigned short int var_1_2 = 16; [L24] unsigned short int var_1_3 = 100; [L25] unsigned short int var_1_4 = 10; [L26] signed short int var_1_5 = 256; [L27] signed short int var_1_6 = -10; [L28] signed short int var_1_7 = -25; [L29] unsigned short int var_1_8 = 64; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 1; [L32] unsigned short int var_1_11 = 256; [L33] unsigned short int var_1_12 = 0; [L34] unsigned short int var_1_13 = 64; [L35] unsigned char var_1_14 = 1; [L36] unsigned char var_1_15 = 0; [L37] signed char var_1_16 = 50; [L38] float var_1_17 = 8.25; [L39] float var_1_18 = 1.25; [L40] signed char var_1_19 = -100; [L41] double var_1_20 = 100000000.8; [L42] double var_1_21 = 15.125; [L43] double var_1_22 = 99.22; [L44] signed long int var_1_23 = -16; [L45] unsigned char var_1_24 = 1; [L46] signed char var_1_25 = 10; [L47] signed char var_1_26 = 16; [L48] unsigned char var_1_27 = 0; [L49] double var_1_28 = 5.5; [L153] isInitial = 1 [L154] FCALL initially() [L155] COND TRUE 1 [L156] FCALL updateLastVariables() [L157] CALL updateVariables() [L89] var_1_2 = __VERIFIER_nondet_ushort() [L90] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L90] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L91] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L91] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_3=100, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L92] var_1_3 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L93] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L94] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L94] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_4=10, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L95] var_1_4 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L96] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_4 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L97] RET assume_abort_if_not(var_1_4 <= 65535) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=256, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L98] var_1_5 = __VERIFIER_nondet_short() [L99] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L99] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L100] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=-10, var_1_7=-25, var_1_8=64, var_1_9=0] [L101] var_1_6 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_6 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L102] RET assume_abort_if_not(var_1_6 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_6 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L103] RET assume_abort_if_not(var_1_6 <= 8192) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=-25, var_1_8=64, var_1_9=0] [L104] var_1_7 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_7 >= -8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L105] RET assume_abort_if_not(var_1_7 >= -8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_7 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L106] RET assume_abort_if_not(var_1_7 <= 8191) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L107] var_1_9 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64] [L108] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64] [L109] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L109] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L110] var_1_10 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L111] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L112] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=256, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L113] var_1_11 = __VERIFIER_nondet_ushort() [L114] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L114] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=1, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L115] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L115] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=0, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L116] var_1_12 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L117] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_12 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L118] RET assume_abort_if_not(var_1_12 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=64, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L119] var_1_13 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L120] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_13 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L121] RET assume_abort_if_not(var_1_13 <= 65534) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=0, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L122] var_1_15 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L123] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L124] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_17=33/4, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L125] var_1_17 = __VERIFIER_nondet_float() [L126] CALL assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L126] RET assume_abort_if_not((var_1_17 >= -922337.2036854776000e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854776000e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_18=5/4, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L127] var_1_18 = __VERIFIER_nondet_float() [L128] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L128] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=-100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L129] var_1_19 = __VERIFIER_nondet_char() [L130] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L130] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L131] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_21=121/8, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L132] var_1_21 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L133] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_22=4961/50, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L134] var_1_22 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L135] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=10, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L136] var_1_25 = __VERIFIER_nondet_char() [L137] CALL assume_abort_if_not(var_1_25 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L137] RET assume_abort_if_not(var_1_25 >= -1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L138] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=16, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L139] var_1_26 = __VERIFIER_nondet_char() [L140] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L140] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L141] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L142] var_1_27 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L143] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_27 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L144] RET assume_abort_if_not(var_1_27 <= 0) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L157] RET updateVariables() [L158] CALL step() [L53] COND TRUE (var_1_2 <= var_1_3) || (var_1_4 > 4) [L54] var_1_1 = (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L58] COND FALSE !(\read(var_1_9)) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L63] EXPR var_1_6 ^ var_1_7 VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=50, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L63] COND FALSE !(var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) [L66] COND FALSE !(var_1_1 < var_1_4) [L77] var_1_16 = 100 VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=100, var_1_1=4, var_1_20=500000004/5, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L79] var_1_20 = (var_1_21 - (var_1_22 + 1.5)) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=100, var_1_1=4, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L80] EXPR ((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6 VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=100, var_1_1=4, var_1_23=-16, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L80] COND FALSE !((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) [L83] var_1_23 = ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16))) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=100, var_1_1=4, var_1_23=100, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=11/2, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L85] var_1_24 = ((var_1_16 <= (var_1_25 - var_1_26)) && var_1_27) [L86] var_1_28 = var_1_21 [L158] RET step() [L159] CALL, EXPR property() [L149] EXPR ((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=100, var_1_1=4, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L149] EXPR var_1_6 ^ var_1_7 VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=100, var_1_1=4, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L149] EXPR ((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=100, var_1_1=4, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L149] EXPR (((((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1)) && ((var_1_1 < var_1_4) ? (((! (var_1_10 || var_1_9)) && var_1_14) ? ((((((2.75f) > (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f))))) ? (2.75f) : (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f)))))) != var_1_18) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16)))))) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=100, var_1_1=4, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L149-L150] return (((((((((var_1_2 <= var_1_3) || (var_1_4 > 4)) ? (var_1_1 == ((signed short int) (((((var_1_5 + (var_1_6 + var_1_7))) > (-100)) ? ((var_1_5 + (var_1_6 + var_1_7))) : (-100))))) : (var_1_1 == ((signed short int) var_1_7))) && (var_1_9 ? (var_1_10 ? (var_1_8 == ((unsigned short int) (((((var_1_11 + var_1_12)) > (var_1_13)) ? ((var_1_11 + var_1_12)) : (var_1_13))))) : 1) : 1)) && ((var_1_5 > (var_1_4 + (var_1_6 ^ var_1_7))) ? (var_1_14 == ((unsigned char) (var_1_9 || var_1_15))) : 1)) && ((var_1_1 < var_1_4) ? (((! (var_1_10 || var_1_9)) && var_1_14) ? ((((((2.75f) > (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f))))) ? (2.75f) : (((((var_1_17) < (999999.95f)) ? (var_1_17) : (999999.95f)))))) != var_1_18) ? (var_1_16 == ((signed char) 10)) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) var_1_19))) : (var_1_16 == ((signed char) 100)))) && (var_1_20 == ((double) (var_1_21 - (var_1_22 + 1.5))))) && (((((((var_1_3) > (var_1_5)) ? (var_1_3) : (var_1_5))) | var_1_6) >= var_1_8) ? (var_1_23 == ((signed long int) (5 - var_1_12))) : (var_1_23 == ((signed long int) ((((var_1_11) > (var_1_16)) ? (var_1_11) : (var_1_16))))))) && (var_1_24 == ((unsigned char) ((var_1_16 <= (var_1_25 - var_1_26)) && var_1_27)))) && (var_1_28 == ((double) var_1_21)) ; [L159] RET, EXPR property() [L159] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=100, var_1_1=4, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_11=100, var_1_12=32767, var_1_13=32866, var_1_14=1, var_1_15=1, var_1_16=100, var_1_19=100, var_1_1=4, var_1_21=100000005, var_1_23=100, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=100000005, var_1_2=0, var_1_3=0, var_1_4=4, var_1_5=-1, var_1_6=0, var_1_7=5, var_1_8=64, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 6, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 542 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 542 mSDsluCounter, 2051 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1428 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1310 IncrementalHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 623 mSDtfsCounter, 1310 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 397 GetRequests, 374 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=5, InterpolantAutomatonStates: 27, 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, 5 MinimizatonAttempts, 248 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 1308 NumberOfCodeBlocks, 1308 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1084 ConstructedInterpolants, 0 QuantifiedInterpolants, 6929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 12600/12600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 05:23:30,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.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 42c6423785198dd4a043b6ffb8b15bc58abdd425ee3b16bee994e5bca051a506 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:23:32,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:23:32,469 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 05:23:32,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:23:32,475 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:23:32,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:23:32,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:23:32,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:23:32,515 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:23:32,516 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:23:32,516 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:23:32,517 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:23:32,517 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:23:32,517 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:23:32,518 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:23:32,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:23:32,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:23:32,519 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:23:32,522 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:23:32,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:23:32,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:23:32,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:23:32,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:23:32,525 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 05:23:32,526 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 05:23:32,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:23:32,526 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 05:23:32,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:23:32,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:23:32,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:23:32,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:23:32,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:23:32,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:23:32,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:23:32,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:23:32,530 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:23:32,531 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:23:32,531 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:23:32,532 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 05:23:32,532 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 05:23:32,532 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:23:32,532 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:23:32,533 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:23:32,533 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:23:32,533 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 05:23:32,533 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 -> 42c6423785198dd4a043b6ffb8b15bc58abdd425ee3b16bee994e5bca051a506 [2024-10-24 05:23:32,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:23:32,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:23:32,900 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:23:32,901 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:23:32,901 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:23:32,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i [2024-10-24 05:23:34,469 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:23:34,710 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:23:34,710 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i [2024-10-24 05:23:34,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ba74513/fac5df3f83c940bd80f83efb6ac396eb/FLAG6b4fd0a36 [2024-10-24 05:23:34,747 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5ba74513/fac5df3f83c940bd80f83efb6ac396eb [2024-10-24 05:23:34,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:23:34,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:23:34,754 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:23:34,754 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:23:34,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:23:34,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:23:34" (1/1) ... [2024-10-24 05:23:34,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e97d79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:34, skipping insertion in model container [2024-10-24 05:23:34,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:23:34" (1/1) ... [2024-10-24 05:23:34,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:23:34,992 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i[913,926] [2024-10-24 05:23:35,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:23:35,078 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:23:35,091 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-65.i[913,926] [2024-10-24 05:23:35,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:23:35,161 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:23:35,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35 WrapperNode [2024-10-24 05:23:35,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:23:35,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:23:35,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:23:35,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:23:35,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,225 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-24 05:23:35,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:23:35,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:23:35,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:23:35,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:23:35,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,259 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 05:23:35,263 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,293 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,298 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:23:35,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:23:35,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:23:35,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:23:35,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (1/1) ... [2024-10-24 05:23:35,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:23:35,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:23:35,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:23:35,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:23:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:23:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 05:23:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:23:35,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:23:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:23:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:23:35,484 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:23:35,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:23:37,445 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-24 05:23:37,445 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:23:37,546 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:23:37,546 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:23:37,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:23:37 BoogieIcfgContainer [2024-10-24 05:23:37,547 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:23:37,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:23:37,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:23:37,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:23:37,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:23:34" (1/3) ... [2024-10-24 05:23:37,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d029c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:23:37, skipping insertion in model container [2024-10-24 05:23:37,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:23:35" (2/3) ... [2024-10-24 05:23:37,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d029c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:23:37, skipping insertion in model container [2024-10-24 05:23:37,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:23:37" (3/3) ... [2024-10-24 05:23:37,555 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-65.i [2024-10-24 05:23:37,571 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:23:37,571 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:23:37,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:23:37,654 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;@7cdaa59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:23:37,654 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:23:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:23:37,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 05:23:37,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:37,675 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:37,676 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:37,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1719827382, now seen corresponding path program 1 times [2024-10-24 05:23:37,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:23:37,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562442797] [2024-10-24 05:23:37,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:37,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:23:37,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:23:37,699 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:23:37,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 05:23:38,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:38,061 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 05:23:38,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:23:38,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2024-10-24 05:23:38,156 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 05:23:38,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 05:23:38,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562442797] [2024-10-24 05:23:38,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562442797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:23:38,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:23:38,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:23:38,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027302599] [2024-10-24 05:23:38,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:23:38,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:23:38,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 05:23:38,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:23:38,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:23:38,197 INFO L87 Difference]: Start difference. First operand has 78 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-24 05:23:38,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:23:38,798 INFO L93 Difference]: Finished difference Result 153 states and 282 transitions. [2024-10-24 05:23:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:23:38,814 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 211 [2024-10-24 05:23:38,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:23:38,820 INFO L225 Difference]: With dead ends: 153 [2024-10-24 05:23:38,820 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 05:23:38,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:23:38,827 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 05:23:38,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 05:23:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 05:23:38,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-24 05:23:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 38 states have (on average 1.236842105263158) internal successors, (47), 38 states have internal predecessors, (47), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-24 05:23:38,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2024-10-24 05:23:38,894 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 119 transitions. Word has length 211 [2024-10-24 05:23:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:23:38,895 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 119 transitions. [2024-10-24 05:23:38,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-24 05:23:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 119 transitions. [2024-10-24 05:23:38,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-24 05:23:38,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:23:38,900 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:23:38,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 05:23:39,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:23:39,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:23:39,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:23:39,103 INFO L85 PathProgramCache]: Analyzing trace with hash -827072458, now seen corresponding path program 1 times [2024-10-24 05:23:39,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 05:23:39,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868408689] [2024-10-24 05:23:39,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:23:39,104 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 05:23:39,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 05:23:39,106 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 05:23:39,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 05:23:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:23:39,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-24 05:23:39,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 05:24:15,970 WARN L286 SmtUtils]: Spent 12.03s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)