./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.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 e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:03:55,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:03:55,216 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:03:55,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:03:55,224 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:03:55,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:03:55,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:03:55,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:03:55,257 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:03:55,259 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:03:55,259 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:03:55,259 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:03:55,260 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:03:55,260 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:03:55,260 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:03:55,261 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:03:55,261 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:03:55,261 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:03:55,261 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:03:55,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:03:55,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:03:55,266 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:03:55,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:03:55,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:03:55,267 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:03:55,267 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:03:55,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:03:55,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:03:55,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:03:55,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:03:55,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:03:55,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:03:55,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:03:55,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:03:55,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:03:55,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:03:55,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:03:55,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:03:55,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:03:55,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:03:55,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:03:55,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:03:55,271 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 -> e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f [2024-11-12 02:03:55,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:03:55,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:03:55,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:03:55,569 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:03:55,570 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:03:55,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-12 02:03:57,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:03:57,309 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:03:57,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-12 02:03:57,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5b73e944/a6c9b665c98548408b26ac1c54864c57/FLAG67e68835e [2024-11-12 02:03:57,335 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5b73e944/a6c9b665c98548408b26ac1c54864c57 [2024-11-12 02:03:57,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:03:57,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:03:57,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:03:57,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:03:57,352 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:03:57,353 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,354 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626378eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57, skipping insertion in model container [2024-11-12 02:03:57,354 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:03:57,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2024-11-12 02:03:57,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:03:57,682 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:03:57,694 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2024-11-12 02:03:57,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:03:57,744 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:03:57,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57 WrapperNode [2024-11-12 02:03:57,745 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:03:57,746 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:03:57,746 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:03:57,746 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:03:57,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,814 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2024-11-12 02:03:57,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:03:57,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:03:57,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:03:57,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:03:57,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,831 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,836 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,857 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 02:03:57,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,875 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:03:57,908 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:03:57,908 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:03:57,908 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:03:57,909 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (1/1) ... [2024-11-12 02:03:57,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:03:57,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:03:57,960 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 02:03:57,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 02:03:58,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:03:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:03:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:03:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:03:58,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:03:58,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:03:58,124 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:03:58,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:03:58,593 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-12 02:03:58,593 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:03:58,611 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:03:58,612 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:03:58,612 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:03:58 BoogieIcfgContainer [2024-11-12 02:03:58,612 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:03:58,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:03:58,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:03:58,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:03:58,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:03:57" (1/3) ... [2024-11-12 02:03:58,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a519367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:03:58, skipping insertion in model container [2024-11-12 02:03:58,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:57" (2/3) ... [2024-11-12 02:03:58,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a519367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:03:58, skipping insertion in model container [2024-11-12 02:03:58,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:03:58" (3/3) ... [2024-11-12 02:03:58,623 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-12 02:03:58,641 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:03:58,641 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:03:58,705 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:03:58,711 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;@3b20a244, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:03:58,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:03:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 66 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:03:58,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 02:03:58,732 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:03:58,733 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:03:58,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:03:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:03:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1185775820, now seen corresponding path program 1 times [2024-11-12 02:03:58,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:03:58,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635142459] [2024-11-12 02:03:58,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:03:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:03:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:03:59,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:03:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:03:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:03:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:03:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:03:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:03:59,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:03:59,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:03:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:03:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:03:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 02:03:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:03:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 02:03:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 02:03:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 02:03:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 02:03:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 02:03:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 02:03:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 02:03:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 02:03:59,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 02:03:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 02:03:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 02:03:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 02:03:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 02:03:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 02:03:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 02:03:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 02:03:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 02:03:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 02:03:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 02:03:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 02:03:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:03:59,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:03:59,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:03:59,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635142459] [2024-11-12 02:03:59,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635142459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:03:59,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:03:59,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:03:59,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016155793] [2024-11-12 02:03:59,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:03:59,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:03:59,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:03:59,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:03:59,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:03:59,329 INFO L87 Difference]: Start difference. First operand has 101 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 66 states have internal predecessors, (90), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:03:59,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:03:59,369 INFO L93 Difference]: Finished difference Result 195 states and 339 transitions. [2024-11-12 02:03:59,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:03:59,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 208 [2024-11-12 02:03:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:03:59,385 INFO L225 Difference]: With dead ends: 195 [2024-11-12 02:03:59,385 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 02:03:59,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:03:59,395 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:03:59,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:03:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 02:03:59,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-12 02:03:59,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:03:59,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2024-11-12 02:03:59,465 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 208 [2024-11-12 02:03:59,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:03:59,466 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2024-11-12 02:03:59,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:03:59,466 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2024-11-12 02:03:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 02:03:59,472 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:03:59,472 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:03:59,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:03:59,473 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:03:59,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:03:59,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1745774514, now seen corresponding path program 1 times [2024-11-12 02:03:59,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:03:59,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125169789] [2024-11-12 02:03:59,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:03:59,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:03:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:04:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:04:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:04:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:04:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:04:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:04:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:04:00,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:04:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:04:00,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:04:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:04:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 02:04:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:04:00,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 02:04:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 02:04:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 02:04:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 02:04:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 02:04:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 02:04:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 02:04:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 02:04:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 02:04:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 02:04:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 02:04:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 02:04:00,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 02:04:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 02:04:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 02:04:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 02:04:00,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 02:04:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 02:04:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 02:04:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 02:04:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:00,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:04:00,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:04:00,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125169789] [2024-11-12 02:04:00,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125169789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:04:00,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:04:00,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:04:00,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814369025] [2024-11-12 02:04:00,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:04:00,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:04:00,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:04:00,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:04:00,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:04:00,152 INFO L87 Difference]: Start difference. First operand 97 states and 149 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:00,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:00,197 INFO L93 Difference]: Finished difference Result 191 states and 295 transitions. [2024-11-12 02:04:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:04:00,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-12 02:04:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:00,200 INFO L225 Difference]: With dead ends: 191 [2024-11-12 02:04:00,201 INFO L226 Difference]: Without dead ends: 97 [2024-11-12 02:04:00,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:04:00,202 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:00,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:04:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-12 02:04:00,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-12 02:04:00,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:04:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2024-11-12 02:04:00,223 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 208 [2024-11-12 02:04:00,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:00,227 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2024-11-12 02:04:00,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:00,227 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2024-11-12 02:04:00,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-12 02:04:00,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:00,233 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:00,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 02:04:00,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:00,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1487609076, now seen corresponding path program 1 times [2024-11-12 02:04:00,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:04:00,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713181890] [2024-11-12 02:04:00,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:00,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:04:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:04:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:04:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:04:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:04:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:04:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:04:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:04:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:04:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:04:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:04:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:04:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 02:04:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:04:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 02:04:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 02:04:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 02:04:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 02:04:03,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 02:04:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 02:04:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 02:04:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 02:04:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 02:04:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 02:04:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 02:04:03,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 02:04:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 02:04:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 02:04:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 02:04:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 02:04:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 02:04:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 02:04:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 02:04:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 02:04:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:03,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:04:03,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:04:03,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713181890] [2024-11-12 02:04:03,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713181890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:04:03,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:04:03,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 02:04:03,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262227890] [2024-11-12 02:04:03,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:04:03,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 02:04:03,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:04:03,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 02:04:03,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:04:03,923 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:04,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:04,727 INFO L93 Difference]: Finished difference Result 226 states and 339 transitions. [2024-11-12 02:04:04,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 02:04:04,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2024-11-12 02:04:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:04,730 INFO L225 Difference]: With dead ends: 226 [2024-11-12 02:04:04,731 INFO L226 Difference]: Without dead ends: 132 [2024-11-12 02:04:04,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:04:04,733 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 41 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:04,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 609 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 02:04:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-12 02:04:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2024-11-12 02:04:04,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 90 states have internal predecessors, (117), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-12 02:04:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2024-11-12 02:04:04,760 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 208 [2024-11-12 02:04:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:04,761 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2024-11-12 02:04:04,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2024-11-12 02:04:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-12 02:04:04,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:04,765 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:04,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 02:04:04,766 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:04,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:04,766 INFO L85 PathProgramCache]: Analyzing trace with hash 672079064, now seen corresponding path program 1 times [2024-11-12 02:04:04,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:04:04,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902116374] [2024-11-12 02:04:04,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:04,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:04:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:04:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:04:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:04:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:04:05,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:04:05,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:04:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:04:05,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:04:05,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:04:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:04:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:04:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 02:04:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:04:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 02:04:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 02:04:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 02:04:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 02:04:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 02:04:05,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 02:04:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 02:04:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 02:04:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 02:04:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 02:04:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 02:04:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 02:04:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 02:04:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 02:04:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 02:04:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 02:04:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 02:04:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 02:04:05,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 02:04:05,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 02:04:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:04:05,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:04:05,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902116374] [2024-11-12 02:04:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902116374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:04:05,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:04:05,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 02:04:05,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123851927] [2024-11-12 02:04:05,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:04:05,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 02:04:05,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:04:05,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 02:04:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:04:05,972 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:06,332 INFO L93 Difference]: Finished difference Result 287 states and 420 transitions. [2024-11-12 02:04:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 02:04:06,334 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-12 02:04:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:06,338 INFO L225 Difference]: With dead ends: 287 [2024-11-12 02:04:06,338 INFO L226 Difference]: Without dead ends: 161 [2024-11-12 02:04:06,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:04:06,340 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 42 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:06,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 690 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 02:04:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-12 02:04:06,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2024-11-12 02:04:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 117 states have internal predecessors, (151), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 02:04:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2024-11-12 02:04:06,360 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 209 [2024-11-12 02:04:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:06,361 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2024-11-12 02:04:06,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2024-11-12 02:04:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-12 02:04:06,363 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:06,363 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:06,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 02:04:06,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:06,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash -339038186, now seen corresponding path program 1 times [2024-11-12 02:04:06,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:04:06,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514501004] [2024-11-12 02:04:06,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:06,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:04:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:06,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:04:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:06,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:04:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:06,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:04:06,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:06,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:04:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:06,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:04:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:06,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:04:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:06,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:04:06,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:06,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:04:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:06,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:04:06,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:06,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:04:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:06,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:04:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 02:04:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:04:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 02:04:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 02:04:07,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 02:04:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 02:04:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 02:04:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 02:04:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 02:04:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 02:04:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 02:04:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 02:04:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 02:04:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 02:04:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 02:04:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 02:04:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 02:04:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 02:04:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 02:04:07,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 02:04:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 02:04:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 02:04:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:04:07,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:04:07,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514501004] [2024-11-12 02:04:07,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514501004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:04:07,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:04:07,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 02:04:07,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678938947] [2024-11-12 02:04:07,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:04:07,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 02:04:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:04:07,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 02:04:07,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 02:04:07,047 INFO L87 Difference]: Start difference. First operand 158 states and 229 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:07,343 INFO L93 Difference]: Finished difference Result 329 states and 470 transitions. [2024-11-12 02:04:07,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 02:04:07,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2024-11-12 02:04:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:07,347 INFO L225 Difference]: With dead ends: 329 [2024-11-12 02:04:07,347 INFO L226 Difference]: Without dead ends: 174 [2024-11-12 02:04:07,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:04:07,351 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 44 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:07,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 654 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:04:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-12 02:04:07,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 141. [2024-11-12 02:04:07,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 97 states have (on average 1.2783505154639174) internal successors, (124), 99 states have internal predecessors, (124), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 02:04:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2024-11-12 02:04:07,387 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 209 [2024-11-12 02:04:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:07,388 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2024-11-12 02:04:07,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:07,388 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2024-11-12 02:04:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-12 02:04:07,391 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:07,391 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:07,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 02:04:07,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:07,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:07,392 INFO L85 PathProgramCache]: Analyzing trace with hash 422623527, now seen corresponding path program 1 times [2024-11-12 02:04:07,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:04:07,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010222039] [2024-11-12 02:04:07,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:07,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:04:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:04:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:04:11,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:04:11,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:04:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:04:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:04:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:04:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:04:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:04:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:04:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:04:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 02:04:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:04:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 02:04:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 02:04:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 02:04:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 02:04:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 02:04:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 02:04:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 02:04:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 02:04:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 02:04:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 02:04:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 02:04:11,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 02:04:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 02:04:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 02:04:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 02:04:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 02:04:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 02:04:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 02:04:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 02:04:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 02:04:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:11,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:04:11,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:04:11,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010222039] [2024-11-12 02:04:11,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010222039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:04:11,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:04:11,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 02:04:11,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777059147] [2024-11-12 02:04:11,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:04:11,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 02:04:11,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:04:11,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 02:04:11,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 02:04:11,382 INFO L87 Difference]: Start difference. First operand 141 states and 202 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:12,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:12,277 INFO L93 Difference]: Finished difference Result 408 states and 576 transitions. [2024-11-12 02:04:12,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 02:04:12,278 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-12 02:04:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:12,283 INFO L225 Difference]: With dead ends: 408 [2024-11-12 02:04:12,283 INFO L226 Difference]: Without dead ends: 278 [2024-11-12 02:04:12,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-12 02:04:12,285 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 99 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:12,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 804 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 02:04:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-12 02:04:12,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 172. [2024-11-12 02:04:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 128 states have (on average 1.3046875) internal successors, (167), 130 states have internal predecessors, (167), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 02:04:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 245 transitions. [2024-11-12 02:04:12,312 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 245 transitions. Word has length 210 [2024-11-12 02:04:12,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:12,314 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 245 transitions. [2024-11-12 02:04:12,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 245 transitions. [2024-11-12 02:04:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-12 02:04:12,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:12,317 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:12,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 02:04:12,318 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:12,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:12,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1123688105, now seen corresponding path program 1 times [2024-11-12 02:04:12,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:04:12,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230027406] [2024-11-12 02:04:12,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:12,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:04:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:04:15,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:04:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:04:15,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:04:15,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:04:15,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:04:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:04:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:04:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:04:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:04:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:04:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 02:04:15,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:04:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 02:04:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 02:04:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 02:04:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 02:04:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 02:04:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 02:04:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 02:04:15,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 02:04:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 02:04:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 02:04:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 02:04:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 02:04:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 02:04:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 02:04:15,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 02:04:15,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 02:04:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 02:04:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 02:04:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 02:04:15,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 02:04:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:04:15,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:04:15,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230027406] [2024-11-12 02:04:15,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230027406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:04:15,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:04:15,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 02:04:15,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019643640] [2024-11-12 02:04:15,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:04:15,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 02:04:15,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:04:15,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 02:04:15,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-12 02:04:15,084 INFO L87 Difference]: Start difference. First operand 172 states and 245 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:15,561 INFO L93 Difference]: Finished difference Result 379 states and 539 transitions. [2024-11-12 02:04:15,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 02:04:15,563 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2024-11-12 02:04:15,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:15,565 INFO L225 Difference]: With dead ends: 379 [2024-11-12 02:04:15,566 INFO L226 Difference]: Without dead ends: 218 [2024-11-12 02:04:15,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-12 02:04:15,570 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 105 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:15,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 562 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 02:04:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-12 02:04:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 172. [2024-11-12 02:04:15,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 128 states have (on average 1.3046875) internal successors, (167), 130 states have internal predecessors, (167), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 02:04:15,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 245 transitions. [2024-11-12 02:04:15,594 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 245 transitions. Word has length 210 [2024-11-12 02:04:15,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:15,594 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 245 transitions. [2024-11-12 02:04:15,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:15,595 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 245 transitions. [2024-11-12 02:04:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-12 02:04:15,597 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:15,597 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:15,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 02:04:15,598 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:15,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:15,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1000087223, now seen corresponding path program 1 times [2024-11-12 02:04:15,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:04:15,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399630044] [2024-11-12 02:04:15,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:15,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:04:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:04:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:04:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:04:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:04:15,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:04:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:04:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:04:15,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:04:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:04:15,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:04:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:04:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 02:04:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:04:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 02:04:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 02:04:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 02:04:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 02:04:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 02:04:15,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 02:04:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 02:04:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 02:04:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 02:04:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 02:04:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 02:04:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 02:04:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 02:04:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 02:04:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 02:04:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 02:04:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 02:04:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 02:04:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 02:04:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 02:04:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:15,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:04:15,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:04:15,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399630044] [2024-11-12 02:04:15,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399630044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:04:15,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:04:15,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:04:15,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081408605] [2024-11-12 02:04:15,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:04:15,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:04:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:04:15,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:04:15,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:04:15,763 INFO L87 Difference]: Start difference. First operand 172 states and 245 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:15,874 INFO L93 Difference]: Finished difference Result 400 states and 566 transitions. [2024-11-12 02:04:15,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:04:15,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-12 02:04:15,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:15,877 INFO L225 Difference]: With dead ends: 400 [2024-11-12 02:04:15,877 INFO L226 Difference]: Without dead ends: 239 [2024-11-12 02:04:15,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:04:15,878 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 39 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:15,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 239 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:04:15,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-11-12 02:04:15,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 208. [2024-11-12 02:04:15,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 164 states have (on average 1.3109756097560976) internal successors, (215), 166 states have internal predecessors, (215), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-12 02:04:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 293 transitions. [2024-11-12 02:04:15,896 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 293 transitions. Word has length 211 [2024-11-12 02:04:15,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:15,897 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 293 transitions. [2024-11-12 02:04:15,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:15,897 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 293 transitions. [2024-11-12 02:04:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-12 02:04:15,899 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:15,900 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:15,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 02:04:15,900 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:15,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:15,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1661474987, now seen corresponding path program 1 times [2024-11-12 02:04:15,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:04:15,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172243060] [2024-11-12 02:04:15,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:04:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:04:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:04:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:04:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:04:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:04:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:04:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:04:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:04:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:04:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:04:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:04:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 02:04:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:04:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 02:04:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 02:04:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 02:04:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 02:04:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 02:04:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 02:04:16,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 02:04:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 02:04:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 02:04:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 02:04:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 02:04:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 02:04:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 02:04:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 02:04:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 02:04:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 02:04:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 02:04:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 02:04:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 02:04:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 02:04:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:04:16,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:04:16,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172243060] [2024-11-12 02:04:16,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172243060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:04:16,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:04:16,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 02:04:16,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642192264] [2024-11-12 02:04:16,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:04:16,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 02:04:16,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:04:16,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 02:04:16,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 02:04:16,186 INFO L87 Difference]: Start difference. First operand 208 states and 293 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:16,398 INFO L93 Difference]: Finished difference Result 581 states and 821 transitions. [2024-11-12 02:04:16,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 02:04:16,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-12 02:04:16,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:16,402 INFO L225 Difference]: With dead ends: 581 [2024-11-12 02:04:16,402 INFO L226 Difference]: Without dead ends: 376 [2024-11-12 02:04:16,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 02:04:16,404 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 102 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:16,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 493 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 02:04:16,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-12 02:04:16,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 276. [2024-11-12 02:04:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 196 states have (on average 1.2755102040816326) internal successors, (250), 198 states have internal predecessors, (250), 72 states have call successors, (72), 7 states have call predecessors, (72), 7 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-12 02:04:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 394 transitions. [2024-11-12 02:04:16,437 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 394 transitions. Word has length 211 [2024-11-12 02:04:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:16,438 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 394 transitions. [2024-11-12 02:04:16,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:16,439 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 394 transitions. [2024-11-12 02:04:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-12 02:04:16,440 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:16,441 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:16,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 02:04:16,441 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:16,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:16,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1028666621, now seen corresponding path program 1 times [2024-11-12 02:04:16,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:04:16,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819447435] [2024-11-12 02:04:16,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:16,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:04:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:04:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:04:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:04:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:04:16,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:04:16,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 02:04:16,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 02:04:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 02:04:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 02:04:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 02:04:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 02:04:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 02:04:16,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 02:04:16,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 02:04:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 02:04:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 02:04:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 02:04:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 02:04:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 02:04:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-12 02:04:16,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-12 02:04:16,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-12 02:04:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-12 02:04:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-12 02:04:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-12 02:04:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-12 02:04:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-12 02:04:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-12 02:04:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-12 02:04:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-12 02:04:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-12 02:04:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 02:04:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-12 02:04:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:04:16,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:04:16,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819447435] [2024-11-12 02:04:16,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819447435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:04:16,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:04:16,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:04:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843969976] [2024-11-12 02:04:16,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:04:16,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:04:16,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:04:16,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:04:16,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:04:16,574 INFO L87 Difference]: Start difference. First operand 276 states and 394 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:16,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:16,685 INFO L93 Difference]: Finished difference Result 508 states and 714 transitions. [2024-11-12 02:04:16,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:04:16,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2024-11-12 02:04:16,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:16,688 INFO L225 Difference]: With dead ends: 508 [2024-11-12 02:04:16,688 INFO L226 Difference]: Without dead ends: 303 [2024-11-12 02:04:16,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:04:16,690 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 46 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:16,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 259 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:04:16,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-12 02:04:16,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 261. [2024-11-12 02:04:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 184 states have internal predecessors, (231), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-12 02:04:16,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 371 transitions. [2024-11-12 02:04:16,725 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 371 transitions. Word has length 211 [2024-11-12 02:04:16,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:16,726 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 371 transitions. [2024-11-12 02:04:16,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:16,726 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 371 transitions. [2024-11-12 02:04:16,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-12 02:04:16,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:16,729 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:16,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 02:04:16,729 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:16,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:16,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1580133698, now seen corresponding path program 1 times [2024-11-12 02:04:16,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:04:16,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548124734] [2024-11-12 02:04:16,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:16,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:04:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:04:16,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201575955] [2024-11-12 02:04:16,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:16,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:04:16,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:04:16,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 02:04:16,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 02:04:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:04:17,006 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 02:04:17,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 02:04:17,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 02:04:17,254 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 02:04:17,255 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 02:04:17,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 02:04:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-12 02:04:17,462 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:17,603 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 02:04:17,607 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:04:17 BoogieIcfgContainer [2024-11-12 02:04:17,608 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 02:04:17,608 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 02:04:17,608 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 02:04:17,608 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 02:04:17,609 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:03:58" (3/4) ... [2024-11-12 02:04:17,611 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 02:04:17,612 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 02:04:17,613 INFO L158 Benchmark]: Toolchain (without parser) took 20273.55ms. Allocated memory was 163.6MB in the beginning and 388.0MB in the end (delta: 224.4MB). Free memory was 93.7MB in the beginning and 199.1MB in the end (delta: -105.4MB). Peak memory consumption was 120.8MB. Max. memory is 16.1GB. [2024-11-12 02:04:17,613 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 109.1MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:04:17,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 402.96ms. Allocated memory is still 163.6MB. Free memory was 93.5MB in the beginning and 130.5MB in the end (delta: -37.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 02:04:17,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.76ms. Allocated memory is still 163.6MB. Free memory was 130.2MB in the beginning and 126.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 02:04:17,614 INFO L158 Benchmark]: Boogie Preprocessor took 89.78ms. Allocated memory is still 163.6MB. Free memory was 126.3MB in the beginning and 121.2MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 02:04:17,614 INFO L158 Benchmark]: RCFGBuilder took 704.98ms. Allocated memory is still 163.6MB. Free memory was 120.6MB in the beginning and 91.9MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-12 02:04:17,615 INFO L158 Benchmark]: TraceAbstraction took 18992.52ms. Allocated memory was 163.6MB in the beginning and 388.0MB in the end (delta: 224.4MB). Free memory was 91.3MB in the beginning and 199.1MB in the end (delta: -107.8MB). Peak memory consumption was 117.8MB. Max. memory is 16.1GB. [2024-11-12 02:04:17,615 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 388.0MB. Free memory is still 199.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 02:04:17,616 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.26ms. Allocated memory is still 109.1MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 402.96ms. Allocated memory is still 163.6MB. Free memory was 93.5MB in the beginning and 130.5MB in the end (delta: -37.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.76ms. Allocated memory is still 163.6MB. Free memory was 130.2MB in the beginning and 126.3MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.78ms. Allocated memory is still 163.6MB. Free memory was 126.3MB in the beginning and 121.2MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 704.98ms. Allocated memory is still 163.6MB. Free memory was 120.6MB in the beginning and 91.9MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 18992.52ms. Allocated memory was 163.6MB in the beginning and 388.0MB in the end (delta: 224.4MB). Free memory was 91.3MB in the beginning and 199.1MB in the end (delta: -107.8MB). Peak memory consumption was 117.8MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 388.0MB. Free memory is still 199.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryFLOATComparisonOperation at line 149. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_23 = 100; [L43] signed long int var_1_24 = 2; [L44] unsigned char var_1_25 = 1; [L45] unsigned char var_1_26 = 1; [L46] unsigned char var_1_27 = 0; [L47] unsigned char var_1_28 = 1; [L48] unsigned char var_1_29 = 1; [L49] float var_1_30 = 2.5; [L50] float var_1_31 = 15.25; [L51] unsigned long int var_1_32 = 256; [L52] unsigned long int var_1_33 = 100; [L53] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L162] isInitial = 1 [L163] FCALL initially() [L164] COND TRUE 1 [L165] CALL updateLastVariables() [L155] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L104] var_1_3 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L105] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L106] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L106] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L107] var_1_4 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L108] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L109] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L109] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L110] var_1_5 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L111] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L112] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L112] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L113] var_1_7 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L114] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L115] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L115] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L116] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L116] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L117] var_1_8 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L118] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L119] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L119] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L120] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L120] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L121] var_1_10 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L122] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L123] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L123] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L124] var_1_11 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L125] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L126] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L126] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L127] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L127] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L128] var_1_16 = __VERIFIER_nondet_long() [L129] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L129] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L130] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L130] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L131] var_1_17 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L132] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L133] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L133] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L134] var_1_21 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L135] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L136] var_1_23 = __VERIFIER_nondet_long() [L137] CALL assume_abort_if_not(var_1_23 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L137] RET assume_abort_if_not(var_1_23 >= -2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_23 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L138] RET assume_abort_if_not(var_1_23 <= 2147483646) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L139] var_1_25 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L140] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L141] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L142] var_1_26 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L143] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L144] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L145] var_1_29 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L146] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L147] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L148] var_1_31 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L149] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L150] var_1_33 = __VERIFIER_nondet_ulong() [L151] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L151] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L152] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L166] RET updateVariables() [L167] CALL step() [L57] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L58] COND FALSE !(var_1_25 && var_1_26) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L63] var_1_27 = 0 [L64] var_1_28 = var_1_29 [L65] var_1_30 = var_1_31 [L66] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L67] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L67] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L72] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L74] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L74] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L75] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L76] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L80] signed long int stepLocal_1 = -4; [L81] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L82] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L87] var_1_18 = var_1_17 [L88] var_1_19 = 0 [L89] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L90] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=126, var_1_12=10, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L93] COND TRUE var_1_3 <= var_1_1 [L94] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L98] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=65534, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=16, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L99] COND TRUE (~ var_1_3) < stepLocal_2 [L100] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L158-L159] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=126, var_1_12=0, var_1_13=-5, var_1_15=190, var_1_16=126, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-10, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.8s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 664 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 664 mSDsluCounter, 4604 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3176 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1264 IncrementalHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 1428 mSDtfsCounter, 1264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 364 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.4s InterpolantComputationTime, 2519 NumberOfCodeBlocks, 2519 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2085 ConstructedInterpolants, 0 QuantifiedInterpolants, 6627 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 21120/21120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 02:04:17,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.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 e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:04:19,925 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:04:20,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 02:04:20,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:04:20,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:04:20,036 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:04:20,037 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:04:20,038 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:04:20,039 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:04:20,039 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:04:20,040 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:04:20,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:04:20,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:04:20,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:04:20,043 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:04:20,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:04:20,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:04:20,044 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:04:20,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:04:20,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:04:20,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:04:20,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:04:20,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:04:20,050 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 02:04:20,051 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 02:04:20,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:04:20,051 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 02:04:20,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:04:20,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:04:20,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:04:20,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:04:20,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:04:20,052 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:04:20,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:04:20,053 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:04:20,053 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:04:20,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:04:20,054 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:04:20,055 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 02:04:20,055 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 02:04:20,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:04:20,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:04:20,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:04:20,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:04:20,057 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 -> e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f [2024-11-12 02:04:20,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:04:20,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:04:20,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:04:20,413 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:04:20,413 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:04:20,414 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-12 02:04:21,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:04:22,121 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:04:22,122 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-12 02:04:22,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3efaab69d/5f6f6cb363a14091abc51ec98dbeb211/FLAGc2f5b42af [2024-11-12 02:04:22,157 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3efaab69d/5f6f6cb363a14091abc51ec98dbeb211 [2024-11-12 02:04:22,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:04:22,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:04:22,164 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:04:22,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:04:22,180 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:04:22,181 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,184 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2040e251 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22, skipping insertion in model container [2024-11-12 02:04:22,184 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,217 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:04:22,410 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2024-11-12 02:04:22,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:04:22,519 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:04:22,534 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2024-11-12 02:04:22,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:04:22,601 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:04:22,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22 WrapperNode [2024-11-12 02:04:22,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:04:22,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:04:22,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:04:22,604 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:04:22,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,631 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,661 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-12 02:04:22,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:04:22,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:04:22,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:04:22,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:04:22,675 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,693 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 02:04:22,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,709 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,715 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,720 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,726 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,732 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:04:22,733 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:04:22,733 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:04:22,733 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:04:22,734 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (1/1) ... [2024-11-12 02:04:22,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:04:22,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:04:22,767 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 02:04:22,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 02:04:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:04:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 02:04:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:04:22,812 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:04:22,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:04:22,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:04:22,898 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:04:22,901 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:04:23,463 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 02:04:23,464 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:04:23,479 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:04:23,479 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:04:23,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:23 BoogieIcfgContainer [2024-11-12 02:04:23,479 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:04:23,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:04:23,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:04:23,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:04:23,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:04:22" (1/3) ... [2024-11-12 02:04:23,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57212ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:04:23, skipping insertion in model container [2024-11-12 02:04:23,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:04:22" (2/3) ... [2024-11-12 02:04:23,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57212ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:04:23, skipping insertion in model container [2024-11-12 02:04:23,490 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:04:23" (3/3) ... [2024-11-12 02:04:23,492 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2024-11-12 02:04:23,508 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:04:23,509 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:04:23,583 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:04:23,590 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;@43035218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:04:23,591 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:04:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:04:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-12 02:04:23,613 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:23,614 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:23,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:23,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:23,621 INFO L85 PathProgramCache]: Analyzing trace with hash 645560812, now seen corresponding path program 1 times [2024-11-12 02:04:23,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:04:23,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218654179] [2024-11-12 02:04:23,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:23,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:04:23,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:04:23,641 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:04:23,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 02:04:23,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:23,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 02:04:23,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:04:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2024-11-12 02:04:24,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:04:24,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:04:24,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218654179] [2024-11-12 02:04:24,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218654179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:04:24,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:04:24,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:04:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615413733] [2024-11-12 02:04:24,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:04:24,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:04:24,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:04:24,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:04:24,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:04:24,071 INFO L87 Difference]: Start difference. First operand has 83 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 48 states have internal predecessors, (62), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:04:24,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:24,115 INFO L93 Difference]: Finished difference Result 159 states and 283 transitions. [2024-11-12 02:04:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:04:24,118 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 202 [2024-11-12 02:04:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:24,126 INFO L225 Difference]: With dead ends: 159 [2024-11-12 02:04:24,127 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 02:04:24,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:04:24,147 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:24,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:04:24,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 02:04:24,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-12 02:04:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:04:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-11-12 02:04:24,213 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 202 [2024-11-12 02:04:24,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:24,215 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-11-12 02:04:24,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:04:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-11-12 02:04:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-12 02:04:24,222 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:24,222 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:24,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 02:04:24,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:04:24,424 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:24,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:24,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1686035182, now seen corresponding path program 1 times [2024-11-12 02:04:24,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:04:24,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266011044] [2024-11-12 02:04:24,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:24,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:04:24,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:04:24,429 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:04:24,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 02:04:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:24,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 02:04:24,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:04:24,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2024-11-12 02:04:24,793 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 02:04:24,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:04:24,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266011044] [2024-11-12 02:04:24,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266011044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:04:24,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:04:24,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 02:04:24,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948020764] [2024-11-12 02:04:24,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:04:24,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 02:04:24,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:04:24,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 02:04:24,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:04:24,798 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:24,880 INFO L93 Difference]: Finished difference Result 155 states and 239 transitions. [2024-11-12 02:04:24,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 02:04:24,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2024-11-12 02:04:24,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:24,892 INFO L225 Difference]: With dead ends: 155 [2024-11-12 02:04:24,892 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 02:04:24,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 02:04:24,894 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:24,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 02:04:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 02:04:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-12 02:04:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:04:24,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2024-11-12 02:04:24,920 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 202 [2024-11-12 02:04:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:24,922 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2024-11-12 02:04:24,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2024-11-12 02:04:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2024-11-12 02:04:24,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-12 02:04:24,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:24,928 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:24,942 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 (3)] Ended with exit code 0 [2024-11-12 02:04:25,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:04:25,129 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:25,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:25,130 INFO L85 PathProgramCache]: Analyzing trace with hash 876688556, now seen corresponding path program 1 times [2024-11-12 02:04:25,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:04:25,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1716832430] [2024-11-12 02:04:25,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:25,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:04:25,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:04:25,134 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:04:25,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 02:04:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:25,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 02:04:25,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:04:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-11-12 02:04:26,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:04:26,808 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 02:04:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1716832430] [2024-11-12 02:04:26,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1716832430] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:04:26,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [987006131] [2024-11-12 02:04:26,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:26,810 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 02:04:26,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 02:04:26,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 02:04:26,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-12 02:04:27,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:27,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 02:04:27,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:04:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 1058 proven. 39 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2024-11-12 02:04:28,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:04:28,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [987006131] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 02:04:28,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 02:04:28,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-11-12 02:04:28,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821059729] [2024-11-12 02:04:28,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 02:04:28,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 02:04:28,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 02:04:28,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 02:04:28,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-12 02:04:28,256 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:04:30,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:04:30,290 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2024-11-12 02:04:30,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-12 02:04:30,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 202 [2024-11-12 02:04:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:04:30,294 INFO L225 Difference]: With dead ends: 243 [2024-11-12 02:04:30,294 INFO L226 Difference]: Without dead ends: 167 [2024-11-12 02:04:30,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 427 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2024-11-12 02:04:30,296 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 144 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-12 02:04:30,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 582 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-12 02:04:30,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-12 02:04:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 85. [2024-11-12 02:04:30,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 33 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-12 02:04:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2024-11-12 02:04:30,334 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 202 [2024-11-12 02:04:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:04:30,337 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2024-11-12 02:04:30,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2024-11-12 02:04:30,337 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2024-11-12 02:04:30,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-12 02:04:30,340 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:04:30,340 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 02:04:30,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 02:04:30,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-12 02:04:30,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 02:04:30,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:04:30,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:04:30,743 INFO L85 PathProgramCache]: Analyzing trace with hash 874841514, now seen corresponding path program 1 times [2024-11-12 02:04:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 02:04:30,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352889706] [2024-11-12 02:04:30,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:04:30,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 02:04:30,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 02:04:30,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 02:04:30,747 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 (6)] Waiting until timeout for monitored process [2024-11-12 02:04:30,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:04:30,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-12 02:04:30,947 INFO L279 TraceCheckSpWp]: Computing forward predicates...