./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_fillercodestructure_filler-pr-ci_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 f6ae2d08b6b9cdbd7b18582cf72b2bfec08200de0cfc5a02e4f3dfeafad06eff --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:47:49,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:47:49,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:47:49,717 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:47:49,719 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:47:49,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:47:49,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:47:49,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:47:49,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:47:49,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:47:49,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:47:49,753 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:47:49,753 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:47:49,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:47:49,755 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:47:49,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:47:49,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:47:49,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:47:49,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:47:49,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:47:49,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:47:49,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:47:49,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:47:49,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:47:49,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:47:49,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:47:49,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:47:49,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:47:49,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:47:49,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:47:49,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:47:49,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:47:49,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:47:49,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:47:49,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:47:49,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:47:49,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:47:49,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:47:49,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:47:49,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:47:49,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:47:49,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:47:49,766 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 -> f6ae2d08b6b9cdbd7b18582cf72b2bfec08200de0cfc5a02e4f3dfeafad06eff [2024-11-08 21:47:50,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:47:50,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:47:50,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:47:50,061 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:47:50,061 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:47:50,062 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-84.i [2024-11-08 21:47:51,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:47:51,706 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:47:51,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-84.i [2024-11-08 21:47:51,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8615f97f3/0c42a54eb9234b1dbcc9530c765f8019/FLAG10bf500a6 [2024-11-08 21:47:51,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8615f97f3/0c42a54eb9234b1dbcc9530c765f8019 [2024-11-08 21:47:51,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:47:51,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:47:51,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:51,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:47:51,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:47:51,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:51" (1/1) ... [2024-11-08 21:47:51,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6895aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:51, skipping insertion in model container [2024-11-08 21:47:51,753 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:47:51" (1/1) ... [2024-11-08 21:47:51,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:47:51,983 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_fillercodestructure_filler-pr-ci_file-84.i[919,932] [2024-11-08 21:47:52,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:52,104 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:47:52,118 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_fillercodestructure_filler-pr-ci_file-84.i[919,932] [2024-11-08 21:47:52,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:47:52,192 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:47:52,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52 WrapperNode [2024-11-08 21:47:52,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:47:52,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:52,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:47:52,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:47:52,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,213 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,284 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2024-11-08 21:47:52,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:47:52,285 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:47:52,285 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:47:52,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:47:52,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,344 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-08 21:47:52,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,390 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:47:52,402 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:47:52,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:47:52,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:47:52,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (1/1) ... [2024-11-08 21:47:52,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:47:52,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:47:52,435 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-08 21:47:52,438 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-08 21:47:52,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:47:52,479 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:47:52,479 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:47:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:47:52,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:47:52,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:47:52,556 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:47:52,558 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:47:53,037 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-08 21:47:53,037 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:47:53,061 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:47:53,062 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:47:53,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:53 BoogieIcfgContainer [2024-11-08 21:47:53,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:47:53,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:47:53,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:47:53,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:47:53,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:47:51" (1/3) ... [2024-11-08 21:47:53,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e0c0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:53, skipping insertion in model container [2024-11-08 21:47:53,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:47:52" (2/3) ... [2024-11-08 21:47:53,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e0c0dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:47:53, skipping insertion in model container [2024-11-08 21:47:53,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:53" (3/3) ... [2024-11-08 21:47:53,074 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-84.i [2024-11-08 21:47:53,090 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:47:53,090 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:47:53,151 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:47:53,158 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;@19151304, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:47:53,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:47:53,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:47:53,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 21:47:53,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:53,187 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:53,188 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:53,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:53,194 INFO L85 PathProgramCache]: Analyzing trace with hash -770746730, now seen corresponding path program 1 times [2024-11-08 21:47:53,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:53,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582635046] [2024-11-08 21:47:53,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:53,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:53,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:47:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:47:53,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:47:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:47:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:47:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:47:53,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:47:53,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:47:53,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:47:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:47:53,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:47:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:47:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:47:53,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:47:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:47:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:47:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:47:53,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:47:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:47:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:47:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:47:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:47:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:47:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:47:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:47:53,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:53,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:47:53,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:53,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582635046] [2024-11-08 21:47:53,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582635046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:53,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:53,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:47:53,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991553753] [2024-11-08 21:47:53,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:53,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:47:53,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:53,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:47:53,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:47:53,892 INFO L87 Difference]: Start difference. First operand has 112 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 78 states have internal predecessors, (112), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 21:47:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:53,940 INFO L93 Difference]: Finished difference Result 217 states and 378 transitions. [2024-11-08 21:47:53,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:47:53,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 211 [2024-11-08 21:47:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:53,955 INFO L225 Difference]: With dead ends: 217 [2024-11-08 21:47:53,955 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 21:47:53,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-08 21:47:53,967 INFO L432 NwaCegarLoop]: 169 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, 169 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-08 21:47:53,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:47:53,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 21:47:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-08 21:47:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.4189189189189189) internal successors, (105), 74 states have internal predecessors, (105), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:47:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 169 transitions. [2024-11-08 21:47:54,029 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 169 transitions. Word has length 211 [2024-11-08 21:47:54,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:54,029 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 169 transitions. [2024-11-08 21:47:54,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 21:47:54,030 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 169 transitions. [2024-11-08 21:47:54,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-08 21:47:54,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:54,037 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:54,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:47:54,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:54,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:54,039 INFO L85 PathProgramCache]: Analyzing trace with hash -2107953454, now seen corresponding path program 1 times [2024-11-08 21:47:54,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:54,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867333133] [2024-11-08 21:47:54,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:54,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:54,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:47:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:47:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:47:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:47:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:47:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:47:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:47:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:47:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:47:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:47:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:47:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:47:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:47:54,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:47:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:47:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:47:54,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:47:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:47:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:47:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:47:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:47:54,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:47:54,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:47:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:47:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:47:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:47:54,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:54,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867333133] [2024-11-08 21:47:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867333133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:54,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:54,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:47:54,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348895456] [2024-11-08 21:47:54,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:54,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:47:54,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:54,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:47:54,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:47:54,500 INFO L87 Difference]: Start difference. First operand 108 states and 169 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:47:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:54,570 INFO L93 Difference]: Finished difference Result 210 states and 329 transitions. [2024-11-08 21:47:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:47:54,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 211 [2024-11-08 21:47:54,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:54,573 INFO L225 Difference]: With dead ends: 210 [2024-11-08 21:47:54,574 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 21:47:54,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-08 21:47:54,576 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 154 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:54,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 153 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:47:54,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 21:47:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-08 21:47:54,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 71 states have internal predecessors, (95), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:47:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 159 transitions. [2024-11-08 21:47:54,598 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 159 transitions. Word has length 211 [2024-11-08 21:47:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:54,604 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 159 transitions. [2024-11-08 21:47:54,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:47:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 159 transitions. [2024-11-08 21:47:54,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 21:47:54,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:54,612 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:47:54,613 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:54,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:54,613 INFO L85 PathProgramCache]: Analyzing trace with hash 103211589, now seen corresponding path program 1 times [2024-11-08 21:47:54,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:54,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161449102] [2024-11-08 21:47:54,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:54,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:47:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:47:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:47:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:47:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:47:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:47:58,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:47:58,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:47:58,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:47:58,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:47:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:47:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:47:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:47:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:47:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:47:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:47:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:47:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:47:58,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:47:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:47:58,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:47:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:47:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:47:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:47:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:47:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:47:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:47:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:47:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:47:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:47:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:47:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:47:58,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:47:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:47:58,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:47:58,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161449102] [2024-11-08 21:47:58,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161449102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:47:58,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:47:58,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:47:58,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991531308] [2024-11-08 21:47:58,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:47:58,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:47:58,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:47:58,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:47:58,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:47:58,661 INFO L87 Difference]: Start difference. First operand 105 states and 159 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:47:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:47:59,579 INFO L93 Difference]: Finished difference Result 250 states and 372 transitions. [2024-11-08 21:47:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:47:59,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-11-08 21:47:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:47:59,587 INFO L225 Difference]: With dead ends: 250 [2024-11-08 21:47:59,588 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 21:47:59,589 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:47:59,590 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 50 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:47:59,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 623 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 21:47:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 21:47:59,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2024-11-08 21:47:59,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 106 states have (on average 1.330188679245283) internal successors, (141), 107 states have internal predecessors, (141), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-08 21:47:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 213 transitions. [2024-11-08 21:47:59,617 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 213 transitions. Word has length 212 [2024-11-08 21:47:59,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:47:59,618 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 213 transitions. [2024-11-08 21:47:59,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:47:59,619 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 213 transitions. [2024-11-08 21:47:59,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 21:47:59,622 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:47:59,622 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:47:59,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:47:59,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:47:59,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:47:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 745246035, now seen corresponding path program 1 times [2024-11-08 21:47:59,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:47:59,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835515302] [2024-11-08 21:47:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:47:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:47:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:00,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:48:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:48:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:48:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:48:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:48:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:48:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:48:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:48:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:48:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:48:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:48:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:48:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:48:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:48:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:48:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:48:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:48:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:48:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:48:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:48:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:48:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:48:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:48:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:48:00,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835515302] [2024-11-08 21:48:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835515302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:00,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:00,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:48:00,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238049864] [2024-11-08 21:48:00,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:00,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:48:00,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:00,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:48:00,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:48:00,946 INFO L87 Difference]: Start difference. First operand 145 states and 213 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:01,386 INFO L93 Difference]: Finished difference Result 327 states and 475 transitions. [2024-11-08 21:48:01,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:48:01,389 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-11-08 21:48:01,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:01,392 INFO L225 Difference]: With dead ends: 327 [2024-11-08 21:48:01,393 INFO L226 Difference]: Without dead ends: 185 [2024-11-08 21:48:01,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 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-08 21:48:01,400 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 62 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:01,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 727 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 21:48:01,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-08 21:48:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2024-11-08 21:48:01,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 140 states have (on average 1.3285714285714285) internal successors, (186), 142 states have internal predecessors, (186), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 21:48:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 262 transitions. [2024-11-08 21:48:01,461 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 262 transitions. Word has length 213 [2024-11-08 21:48:01,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:01,462 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 262 transitions. [2024-11-08 21:48:01,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:01,462 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 262 transitions. [2024-11-08 21:48:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-08 21:48:01,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:01,468 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:01,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:48:01,468 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:01,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:01,469 INFO L85 PathProgramCache]: Analyzing trace with hash 964100753, now seen corresponding path program 1 times [2024-11-08 21:48:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:01,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079627815] [2024-11-08 21:48:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:01,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:48:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:48:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:48:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:48:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:48:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:48:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:48:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:48:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:48:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:48:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:48:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:48:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:48:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:48:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:48:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:48:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:48:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:48:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:48:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:48:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:48:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:48:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:48:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:48:02,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:02,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079627815] [2024-11-08 21:48:02,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079627815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:02,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:02,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 21:48:02,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126950819] [2024-11-08 21:48:02,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:02,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 21:48:02,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:02,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 21:48:02,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 21:48:02,150 INFO L87 Difference]: Start difference. First operand 182 states and 262 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:02,424 INFO L93 Difference]: Finished difference Result 377 states and 536 transitions. [2024-11-08 21:48:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 21:48:02,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-11-08 21:48:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:02,427 INFO L225 Difference]: With dead ends: 377 [2024-11-08 21:48:02,427 INFO L226 Difference]: Without dead ends: 198 [2024-11-08 21:48:02,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 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-08 21:48:02,429 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 95 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:02,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 610 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:48:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-08 21:48:02,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 157. [2024-11-08 21:48:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 114 states have (on average 1.2982456140350878) internal successors, (148), 116 states have internal predecessors, (148), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 21:48:02,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 224 transitions. [2024-11-08 21:48:02,460 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 224 transitions. Word has length 213 [2024-11-08 21:48:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:02,461 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 224 transitions. [2024-11-08 21:48:02,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:02,462 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 224 transitions. [2024-11-08 21:48:02,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 21:48:02,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:02,465 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:02,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 21:48:02,466 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:02,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:02,466 INFO L85 PathProgramCache]: Analyzing trace with hash 192927104, now seen corresponding path program 1 times [2024-11-08 21:48:02,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:02,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305865657] [2024-11-08 21:48:02,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:02,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:11,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:11,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:48:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:48:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:48:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:48:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:48:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:48:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:48:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:48:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:48:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:48:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:48:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:48:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:48:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:48:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:48:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:48:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:48:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:48:11,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:48:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:48:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:48:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:48:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:48:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:48:11,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:11,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305865657] [2024-11-08 21:48:11,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305865657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:11,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:11,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-08 21:48:11,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693784337] [2024-11-08 21:48:11,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:11,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 21:48:11,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:11,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 21:48:11,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2024-11-08 21:48:11,301 INFO L87 Difference]: Start difference. First operand 157 states and 224 transitions. Second operand has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-08 21:48:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:17,521 INFO L93 Difference]: Finished difference Result 516 states and 722 transitions. [2024-11-08 21:48:17,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 21:48:17,522 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 214 [2024-11-08 21:48:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:17,525 INFO L225 Difference]: With dead ends: 516 [2024-11-08 21:48:17,525 INFO L226 Difference]: Without dead ends: 370 [2024-11-08 21:48:17,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2024-11-08 21:48:17,526 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 1081 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:17,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 633 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1164 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-08 21:48:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-08 21:48:17,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 212. [2024-11-08 21:48:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 169 states have (on average 1.3372781065088757) internal successors, (226), 171 states have internal predecessors, (226), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 21:48:17,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 302 transitions. [2024-11-08 21:48:17,564 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 302 transitions. Word has length 214 [2024-11-08 21:48:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:17,565 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 302 transitions. [2024-11-08 21:48:17,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5625) internal successors, (57), 16 states have internal predecessors, (57), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-08 21:48:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 302 transitions. [2024-11-08 21:48:17,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 21:48:17,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:17,568 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:17,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 21:48:17,568 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:17,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:17,568 INFO L85 PathProgramCache]: Analyzing trace with hash 451092542, now seen corresponding path program 1 times [2024-11-08 21:48:17,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:17,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30544895] [2024-11-08 21:48:17,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:17,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:48:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:48:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:48:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:48:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:48:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:48:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:48:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:48:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:48:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:48:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:48:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:48:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:48:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:48:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:48:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:48:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:48:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:48:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:48:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:48:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:48:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:48:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:48:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:48:20,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:20,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30544895] [2024-11-08 21:48:20,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30544895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:20,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:20,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 21:48:20,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790894256] [2024-11-08 21:48:20,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:20,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 21:48:20,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:20,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 21:48:20,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:48:20,414 INFO L87 Difference]: Start difference. First operand 212 states and 302 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:21,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:21,711 INFO L93 Difference]: Finished difference Result 509 states and 718 transitions. [2024-11-08 21:48:21,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 21:48:21,712 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-11-08 21:48:21,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:21,714 INFO L225 Difference]: With dead ends: 509 [2024-11-08 21:48:21,714 INFO L226 Difference]: Without dead ends: 308 [2024-11-08 21:48:21,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-08 21:48:21,716 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 144 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:21,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1018 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 21:48:21,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-08 21:48:21,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 222. [2024-11-08 21:48:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 181 states have internal predecessors, (240), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 21:48:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 316 transitions. [2024-11-08 21:48:21,752 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 316 transitions. Word has length 214 [2024-11-08 21:48:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:21,752 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 316 transitions. [2024-11-08 21:48:21,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 316 transitions. [2024-11-08 21:48:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 21:48:21,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:21,756 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:21,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 21:48:21,756 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:21,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:21,757 INFO L85 PathProgramCache]: Analyzing trace with hash -818190146, now seen corresponding path program 1 times [2024-11-08 21:48:21,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:21,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21894701] [2024-11-08 21:48:21,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:21,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:48:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:48:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:48:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:48:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:48:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:48:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:48:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:48:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:48:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:48:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:48:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:48:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:48:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:48:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:48:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:48:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:48:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:48:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:48:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:48:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:48:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:48:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:48:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:23,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:48:23,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:23,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21894701] [2024-11-08 21:48:23,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21894701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:23,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:23,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 21:48:23,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024830647] [2024-11-08 21:48:23,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:23,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 21:48:23,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:23,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 21:48:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:48:23,564 INFO L87 Difference]: Start difference. First operand 222 states and 316 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:24,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:24,526 INFO L93 Difference]: Finished difference Result 557 states and 781 transitions. [2024-11-08 21:48:24,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 21:48:24,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-11-08 21:48:24,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:24,530 INFO L225 Difference]: With dead ends: 557 [2024-11-08 21:48:24,530 INFO L226 Difference]: Without dead ends: 346 [2024-11-08 21:48:24,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-08 21:48:24,532 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 158 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:24,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 681 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 21:48:24,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-08 21:48:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 226. [2024-11-08 21:48:24,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 183 states have (on average 1.3442622950819672) internal successors, (246), 185 states have internal predecessors, (246), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 21:48:24,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 322 transitions. [2024-11-08 21:48:24,565 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 322 transitions. Word has length 214 [2024-11-08 21:48:24,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:24,566 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 322 transitions. [2024-11-08 21:48:24,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 322 transitions. [2024-11-08 21:48:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 21:48:24,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:24,568 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:24,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 21:48:24,568 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:24,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:24,569 INFO L85 PathProgramCache]: Analyzing trace with hash -560024708, now seen corresponding path program 1 times [2024-11-08 21:48:24,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:24,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981028001] [2024-11-08 21:48:24,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:24,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:48:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:48:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:48:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:48:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:48:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:48:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:48:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:48:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:48:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:48:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:48:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:48:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:48:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:48:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:48:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:48:27,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:48:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:48:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:48:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:48:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:48:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:48:27,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:48:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:48:27,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:27,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981028001] [2024-11-08 21:48:27,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981028001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:27,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:27,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 21:48:27,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598769140] [2024-11-08 21:48:27,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:27,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 21:48:27,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:27,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 21:48:27,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 21:48:27,113 INFO L87 Difference]: Start difference. First operand 226 states and 322 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:28,339 INFO L93 Difference]: Finished difference Result 537 states and 754 transitions. [2024-11-08 21:48:28,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 21:48:28,340 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-11-08 21:48:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:28,343 INFO L225 Difference]: With dead ends: 537 [2024-11-08 21:48:28,343 INFO L226 Difference]: Without dead ends: 322 [2024-11-08 21:48:28,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-08 21:48:28,344 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 93 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:28,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 901 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 21:48:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-08 21:48:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 222. [2024-11-08 21:48:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 179 states have (on average 1.3407821229050279) internal successors, (240), 181 states have internal predecessors, (240), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 21:48:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 316 transitions. [2024-11-08 21:48:28,375 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 316 transitions. Word has length 214 [2024-11-08 21:48:28,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:28,376 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 316 transitions. [2024-11-08 21:48:28,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:28,376 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 316 transitions. [2024-11-08 21:48:28,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-08 21:48:28,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:28,379 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:28,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 21:48:28,379 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:28,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:28,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1210602756, now seen corresponding path program 1 times [2024-11-08 21:48:28,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:28,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504296885] [2024-11-08 21:48:28,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:30,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:30,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:48:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:48:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:48:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:48:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:48:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:48:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:48:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:48:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:48:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:48:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:48:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:48:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:48:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:48:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:48:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:48:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:48:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:48:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:48:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:48:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:48:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:48:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:48:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:30,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:48:30,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:30,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504296885] [2024-11-08 21:48:30,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504296885] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:30,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:30,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 21:48:30,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134410512] [2024-11-08 21:48:30,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:30,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 21:48:30,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:30,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 21:48:30,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 21:48:30,295 INFO L87 Difference]: Start difference. First operand 222 states and 316 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:30,966 INFO L93 Difference]: Finished difference Result 569 states and 793 transitions. [2024-11-08 21:48:30,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:48:30,967 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-11-08 21:48:30,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:30,969 INFO L225 Difference]: With dead ends: 569 [2024-11-08 21:48:30,969 INFO L226 Difference]: Without dead ends: 358 [2024-11-08 21:48:30,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-08 21:48:30,972 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 140 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:30,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 717 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:48:30,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-08 21:48:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 208. [2024-11-08 21:48:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 165 states have (on average 1.3333333333333333) internal successors, (220), 167 states have internal predecessors, (220), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 21:48:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 296 transitions. [2024-11-08 21:48:31,002 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 296 transitions. Word has length 214 [2024-11-08 21:48:31,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:31,002 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 296 transitions. [2024-11-08 21:48:31,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:31,003 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 296 transitions. [2024-11-08 21:48:31,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 21:48:31,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:31,005 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:31,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 21:48:31,005 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:31,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:31,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1825534535, now seen corresponding path program 1 times [2024-11-08 21:48:31,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:31,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075439389] [2024-11-08 21:48:31,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:31,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:48:31,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:48:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:48:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:48:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:48:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:48:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:48:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:48:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:48:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:48:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:48:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:48:31,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:48:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:48:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:48:31,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:48:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:48:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:48:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:48:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:48:31,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:48:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:48:31,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:48:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:48:31,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:31,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075439389] [2024-11-08 21:48:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075439389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:31,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:31,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:48:31,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549730772] [2024-11-08 21:48:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:31,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:48:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:31,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:48:31,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:48:31,122 INFO L87 Difference]: Start difference. First operand 208 states and 296 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:31,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:31,250 INFO L93 Difference]: Finished difference Result 492 states and 697 transitions. [2024-11-08 21:48:31,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:48:31,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2024-11-08 21:48:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:31,252 INFO L225 Difference]: With dead ends: 492 [2024-11-08 21:48:31,252 INFO L226 Difference]: Without dead ends: 295 [2024-11-08 21:48:31,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-08 21:48:31,253 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 46 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:31,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 249 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:48:31,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-08 21:48:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 264. [2024-11-08 21:48:31,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 221 states have (on average 1.3438914027149322) internal successors, (297), 223 states have internal predecessors, (297), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 21:48:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 373 transitions. [2024-11-08 21:48:31,288 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 373 transitions. Word has length 215 [2024-11-08 21:48:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:31,291 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 373 transitions. [2024-11-08 21:48:31,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 373 transitions. [2024-11-08 21:48:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 21:48:31,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:31,293 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:31,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 21:48:31,293 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:31,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash -711228856, now seen corresponding path program 1 times [2024-11-08 21:48:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319508864] [2024-11-08 21:48:31,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:48:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:48:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:48:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:48:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:48:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:48:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:48:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:48:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:48:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:48:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:48:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:48:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:48:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:48:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:48:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:48:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:48:31,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:48:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:48:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:48:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:48:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:48:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:48:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:48:31,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:31,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319508864] [2024-11-08 21:48:31,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319508864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:31,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:31,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:48:31,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191950405] [2024-11-08 21:48:31,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:31,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:48:31,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:31,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:48:31,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:48:31,593 INFO L87 Difference]: Start difference. First operand 264 states and 373 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:31,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:31,832 INFO L93 Difference]: Finished difference Result 729 states and 1032 transitions. [2024-11-08 21:48:31,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:48:31,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2024-11-08 21:48:31,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:31,837 INFO L225 Difference]: With dead ends: 729 [2024-11-08 21:48:31,837 INFO L226 Difference]: Without dead ends: 468 [2024-11-08 21:48:31,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 67 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-08 21:48:31,838 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 112 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:31,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 539 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:48:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-08 21:48:31,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 328. [2024-11-08 21:48:31,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 250 states have (on average 1.308) internal successors, (327), 252 states have internal predecessors, (327), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 21:48:31,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 467 transitions. [2024-11-08 21:48:31,881 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 467 transitions. Word has length 215 [2024-11-08 21:48:31,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:31,881 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 467 transitions. [2024-11-08 21:48:31,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 467 transitions. [2024-11-08 21:48:31,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 21:48:31,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:31,883 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:31,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 21:48:31,883 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:31,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:31,884 INFO L85 PathProgramCache]: Analyzing trace with hash -2014960166, now seen corresponding path program 1 times [2024-11-08 21:48:31,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:31,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107813675] [2024-11-08 21:48:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:48:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:48:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:48:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:48:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:48:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:48:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:48:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:48:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 21:48:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:48:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 21:48:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 21:48:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 21:48:31,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 21:48:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 21:48:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 21:48:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 21:48:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 21:48:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 21:48:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 21:48:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 21:48:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 21:48:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 21:48:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-08 21:48:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-08 21:48:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-08 21:48:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-08 21:48:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-08 21:48:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-08 21:48:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 21:48:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-08 21:48:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:31,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-08 21:48:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:32,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:48:32,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:32,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107813675] [2024-11-08 21:48:32,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107813675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:32,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:32,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 21:48:32,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294433739] [2024-11-08 21:48:32,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:32,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:48:32,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:32,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:48:32,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:48:32,003 INFO L87 Difference]: Start difference. First operand 328 states and 467 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:32,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:32,126 INFO L93 Difference]: Finished difference Result 616 states and 867 transitions. [2024-11-08 21:48:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:48:32,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 215 [2024-11-08 21:48:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:32,130 INFO L225 Difference]: With dead ends: 616 [2024-11-08 21:48:32,130 INFO L226 Difference]: Without dead ends: 355 [2024-11-08 21:48:32,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 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-08 21:48:32,131 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 53 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:32,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 287 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:48:32,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-08 21:48:32,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 313. [2024-11-08 21:48:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 237 states have (on average 1.2995780590717299) internal successors, (308), 238 states have internal predecessors, (308), 68 states have call successors, (68), 7 states have call predecessors, (68), 7 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 21:48:32,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 444 transitions. [2024-11-08 21:48:32,175 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 444 transitions. Word has length 215 [2024-11-08 21:48:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:32,176 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 444 transitions. [2024-11-08 21:48:32,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:32,176 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 444 transitions. [2024-11-08 21:48:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 21:48:32,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:32,178 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:32,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 21:48:32,178 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:32,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:32,179 INFO L85 PathProgramCache]: Analyzing trace with hash -114794821, now seen corresponding path program 1 times [2024-11-08 21:48:32,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:32,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219767065] [2024-11-08 21:48:32,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:32,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:48:32,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [121883846] [2024-11-08 21:48:32,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:32,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:48:32,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:48:32,271 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-08 21:48:32,273 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-08 21:48:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:32,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 21:48:32,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1351 proven. 198 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-08 21:48:33,596 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:48:34,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:48:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219767065] [2024-11-08 21:48:34,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 21:48:34,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121883846] [2024-11-08 21:48:34,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121883846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:48:34,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 21:48:34,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-08 21:48:34,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978381893] [2024-11-08 21:48:34,623 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 21:48:34,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-08 21:48:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:48:34,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-08 21:48:34,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=314, Unknown=4, NotChecked=0, Total=462 [2024-11-08 21:48:34,624 INFO L87 Difference]: Start difference. First operand 313 states and 444 transitions. Second operand has 16 states, 16 states have (on average 5.0) internal successors, (80), 15 states have internal predecessors, (80), 6 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-08 21:48:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:35,266 INFO L93 Difference]: Finished difference Result 645 states and 877 transitions. [2024-11-08 21:48:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 21:48:35,267 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 15 states have internal predecessors, (80), 6 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) Word has length 216 [2024-11-08 21:48:35,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:35,270 INFO L225 Difference]: With dead ends: 645 [2024-11-08 21:48:35,270 INFO L226 Difference]: Without dead ends: 399 [2024-11-08 21:48:35,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=270, Invalid=538, Unknown=4, NotChecked=0, Total=812 [2024-11-08 21:48:35,272 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 419 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:35,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 381 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 21:48:35,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-08 21:48:35,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 349. [2024-11-08 21:48:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 264 states have (on average 1.2234848484848484) internal successors, (323), 265 states have internal predecessors, (323), 68 states have call successors, (68), 16 states have call predecessors, (68), 16 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-08 21:48:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 459 transitions. [2024-11-08 21:48:35,317 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 459 transitions. Word has length 216 [2024-11-08 21:48:35,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:35,317 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 459 transitions. [2024-11-08 21:48:35,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 15 states have internal predecessors, (80), 6 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 5 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-08 21:48:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 459 transitions. [2024-11-08 21:48:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-08 21:48:35,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:35,319 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:35,339 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-08 21:48:35,520 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,SelfDestructingSolverStorable13 [2024-11-08 21:48:35,520 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:35,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:35,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1381036737, now seen corresponding path program 1 times [2024-11-08 21:48:35,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:48:35,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218385275] [2024-11-08 21:48:35,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:35,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:48:35,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:48:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850192290] [2024-11-08 21:48:35,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:35,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:48:35,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:48:35,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 21:48:35,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 21:48:35,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:48:35,782 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:48:35,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:48:36,010 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:48:36,013 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:48:36,014 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:48:36,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 21:48:36,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 21:48:36,222 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:48:36,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:48:36,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:48:36 BoogieIcfgContainer [2024-11-08 21:48:36,386 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:48:36,387 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:48:36,387 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:48:36,387 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:48:36,388 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:47:53" (3/4) ... [2024-11-08 21:48:36,391 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:48:36,392 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:48:36,393 INFO L158 Benchmark]: Toolchain (without parser) took 44649.25ms. Allocated memory was 151.0MB in the beginning and 427.8MB in the end (delta: 276.8MB). Free memory was 81.8MB in the beginning and 227.8MB in the end (delta: -146.0MB). Peak memory consumption was 133.6MB. Max. memory is 16.1GB. [2024-11-08 21:48:36,393 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:48:36,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 446.90ms. Allocated memory is still 151.0MB. Free memory was 81.5MB in the beginning and 63.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 21:48:36,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.35ms. Allocated memory is still 151.0MB. Free memory was 63.6MB in the beginning and 121.2MB in the end (delta: -57.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2024-11-08 21:48:36,394 INFO L158 Benchmark]: Boogie Preprocessor took 115.37ms. Allocated memory is still 151.0MB. Free memory was 121.2MB in the beginning and 114.6MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-08 21:48:36,394 INFO L158 Benchmark]: RCFGBuilder took 660.81ms. Allocated memory is still 151.0MB. Free memory was 114.6MB in the beginning and 81.7MB in the end (delta: 33.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-08 21:48:36,395 INFO L158 Benchmark]: TraceAbstraction took 43321.68ms. Allocated memory was 151.0MB in the beginning and 427.8MB in the end (delta: 276.8MB). Free memory was 81.1MB in the beginning and 228.9MB in the end (delta: -147.8MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. [2024-11-08 21:48:36,395 INFO L158 Benchmark]: Witness Printer took 5.48ms. Allocated memory is still 427.8MB. Free memory was 228.9MB in the beginning and 227.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 21:48:36,399 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.18ms. Allocated memory is still 121.6MB. Free memory is still 82.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 446.90ms. Allocated memory is still 151.0MB. Free memory was 81.5MB in the beginning and 63.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.35ms. Allocated memory is still 151.0MB. Free memory was 63.6MB in the beginning and 121.2MB in the end (delta: -57.6MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.37ms. Allocated memory is still 151.0MB. Free memory was 121.2MB in the beginning and 114.6MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 660.81ms. Allocated memory is still 151.0MB. Free memory was 114.6MB in the beginning and 81.7MB in the end (delta: 33.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 43321.68ms. Allocated memory was 151.0MB in the beginning and 427.8MB in the end (delta: 276.8MB). Free memory was 81.1MB in the beginning and 228.9MB in the end (delta: -147.8MB). Peak memory consumption was 131.1MB. Max. memory is 16.1GB. * Witness Printer took 5.48ms. Allocated memory is still 427.8MB. Free memory was 228.9MB in the beginning and 227.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 189, overapproximation of someUnaryDOUBLEoperation at line 79. 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_24 = 2; [L43] unsigned char var_1_27 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 0; [L49] signed short int var_1_35 = 8; [L50] signed short int var_1_37 = -4; [L51] float var_1_38 = 15.875; [L52] double var_1_39 = 0.125; [L53] double var_1_40 = 3.8; [L54] signed char var_1_43 = -8; [L55] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L193] isInitial = 1 [L194] FCALL initially() [L195] COND TRUE 1 [L196] CALL updateLastVariables() [L186] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L196] RET updateLastVariables() [L197] CALL updateVariables() [L136] var_1_3 = __VERIFIER_nondet_char() [L137] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L137] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L138] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L139] var_1_4 = __VERIFIER_nondet_char() [L140] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L140] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L142] var_1_5 = __VERIFIER_nondet_char() [L143] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L143] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L145] var_1_7 = __VERIFIER_nondet_long() [L146] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L146] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L147] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L147] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L148] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L148] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L149] var_1_8 = __VERIFIER_nondet_long() [L150] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L153] var_1_10 = __VERIFIER_nondet_uchar() [L154] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L154] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L155] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L155] 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L156] var_1_11 = __VERIFIER_nondet_uchar() [L157] 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=1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L157] 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=1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L158] 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=1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L158] 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=1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L159] 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=1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L159] 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=1, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L160] var_1_16 = __VERIFIER_nondet_long() [L161] 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L161] 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L162] 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L162] 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L163] var_1_17 = __VERIFIER_nondet_ushort() [L164] 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L164] 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L165] 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L165] 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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] var_1_21 = __VERIFIER_nondet_double() [L167] 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L167] 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L168] var_1_29 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L169] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L170] CALL assume_abort_if_not(var_1_29 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L170] RET assume_abort_if_not(var_1_29 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L171] var_1_30 = __VERIFIER_nondet_uchar() [L172] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L172] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L173] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L173] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L174] var_1_31 = __VERIFIER_nondet_uchar() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L176] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L176] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L177] var_1_32 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L178] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L179] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L179] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L180] var_1_39 = __VERIFIER_nondet_double() [L181] CALL assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L181] RET assume_abort_if_not((var_1_39 >= 0.0F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L182] var_1_40 = __VERIFIER_nondet_double() [L183] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L183] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L197] RET updateVariables() [L198] CALL step() [L59] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L59] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L64] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L66] 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=1, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L66] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L67] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L68] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L72] var_1_37 = ((((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) < (var_1_1)) ? (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))) : (var_1_1))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-10, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L73] COND FALSE !(var_1_7 == var_1_11) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, 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_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-10, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L78] COND TRUE var_1_40 >= var_1_39 [L79] var_1_38 = ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, 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] signed long int stepLocal_1 = -4; [L83] 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=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L84] 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=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L89] COND FALSE !(var_1_19 && var_1_19) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L94] var_1_18 = var_1_17 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L95] COND TRUE var_1_5 != ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) [L96] var_1_33 = (5 + var_1_11) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, 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] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, 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 FALSE !(((var_1_4 + -128) % var_1_17) >= var_1_4) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L105] var_1_19 = 0 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L106] COND FALSE !((~ var_1_4) > (var_1_11 / var_1_17)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L109] 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=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L110] 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=1, var_1_12=10, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L113] COND TRUE var_1_3 <= var_1_1 [L114] 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=1, var_1_12=0, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L118] var_1_22 = var_1_10 [L119] 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=1, var_1_12=0, var_1_13=16, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L120] COND TRUE (~ var_1_3) < stepLocal_2 [L121] 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=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L123] 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=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L198] RET step() [L199] CALL, EXPR property() [L189] 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=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L189] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L189] 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=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L189] 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=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L189] 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=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L189] 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=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L189-L190] 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)) ; [L199] RET, EXPR property() [L199] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, 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=1, var_1_12=0, var_1_13=-5, var_1_15=65, var_1_16=0, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_22=127, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=6, var_1_35=8, var_1_37=-10, var_1_38=3, var_1_3=-10, var_1_43=-8, 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, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.1s, OverallIterations: 15, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2609 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2607 mSDsluCounter, 7688 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5673 mSDsCounter, 324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4552 IncrementalHoareTripleChecker+Invalid, 4876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 324 mSolverCounterUnsat, 2015 mSDtfsCounter, 4552 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1322 GetRequests, 1197 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 11.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=349occurred in iteration=14, InterpolantAutomatonStates: 110, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 924 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 26.8s InterpolantComputationTime, 3639 NumberOfCodeBlocks, 3639 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2977 ConstructedInterpolants, 0 QuantifiedInterpolants, 18198 SizeOfPredicates, 3 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 27578/27776 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-08 21:48:36,552 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_fillercodestructure_filler-pr-ci_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 f6ae2d08b6b9cdbd7b18582cf72b2bfec08200de0cfc5a02e4f3dfeafad06eff --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:48:38,717 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:48:38,792 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:48:38,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:48:38,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:48:38,833 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:48:38,834 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:48:38,834 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:48:38,835 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:48:38,837 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:48:38,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:48:38,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:48:38,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:48:38,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:48:38,839 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:48:38,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:48:38,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:48:38,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:48:38,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:48:38,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:48:38,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:48:38,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:48:38,846 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:48:38,846 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:48:38,846 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:48:38,846 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:48:38,847 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:48:38,847 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:48:38,847 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:48:38,847 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:48:38,848 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:48:38,849 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:48:38,849 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:48:38,849 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:48:38,850 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:48:38,850 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:48:38,851 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:48:38,851 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:48:38,851 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:48:38,852 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:48:38,852 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:48:38,852 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:48:38,852 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:48:38,852 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:48:38,853 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 -> f6ae2d08b6b9cdbd7b18582cf72b2bfec08200de0cfc5a02e4f3dfeafad06eff [2024-11-08 21:48:39,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:48:39,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:48:39,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:48:39,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:48:39,208 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:48:39,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-84.i [2024-11-08 21:48:40,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:48:40,984 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:48:40,984 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-84.i [2024-11-08 21:48:40,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd0bc6b4/9428b8e16ff6446da3eaad74d6005e8f/FLAGd89ae4aff [2024-11-08 21:48:41,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cd0bc6b4/9428b8e16ff6446da3eaad74d6005e8f [2024-11-08 21:48:41,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:48:41,009 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:48:41,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:48:41,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:48:41,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:48:41,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,018 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ebafe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41, skipping insertion in model container [2024-11-08 21:48:41,019 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:48:41,251 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_fillercodestructure_filler-pr-ci_file-84.i[919,932] [2024-11-08 21:48:41,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:48:41,379 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:48:41,392 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_fillercodestructure_filler-pr-ci_file-84.i[919,932] [2024-11-08 21:48:41,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:48:41,468 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:48:41,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41 WrapperNode [2024-11-08 21:48:41,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:48:41,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:48:41,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:48:41,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:48:41,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,532 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-08 21:48:41,532 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:48:41,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:48:41,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:48:41,533 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:48:41,551 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,578 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-08 21:48:41,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,598 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,605 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:48:41,626 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:48:41,627 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:48:41,627 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:48:41,628 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (1/1) ... [2024-11-08 21:48:41,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:48:41,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:48:41,662 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-08 21:48:41,667 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-08 21:48:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:48:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:48:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:48:41,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:48:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:48:41,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:48:41,799 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:48:41,801 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:48:43,110 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 21:48:43,110 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:48:43,124 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:48:43,124 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:48:43,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:48:43 BoogieIcfgContainer [2024-11-08 21:48:43,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:48:43,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:48:43,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:48:43,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:48:43,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:48:41" (1/3) ... [2024-11-08 21:48:43,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6565c4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:48:43, skipping insertion in model container [2024-11-08 21:48:43,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:48:41" (2/3) ... [2024-11-08 21:48:43,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6565c4b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:48:43, skipping insertion in model container [2024-11-08 21:48:43,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:48:43" (3/3) ... [2024-11-08 21:48:43,132 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-84.i [2024-11-08 21:48:43,145 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:48:43,145 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:48:43,209 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:48:43,215 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;@1918fc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:48:43,215 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:48:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:48:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 21:48:43,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:43,239 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:43,240 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:43,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:43,244 INFO L85 PathProgramCache]: Analyzing trace with hash -666742730, now seen corresponding path program 1 times [2024-11-08 21:48:43,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:48:43,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450493640] [2024-11-08 21:48:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:43,257 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-08 21:48:43,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:48:43,260 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-08 21:48:43,284 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-08 21:48:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:43,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:48:43,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:43,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-08 21:48:43,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:48:43,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:48:43,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450493640] [2024-11-08 21:48:43,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450493640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:43,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:43,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:48:43,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804913558] [2024-11-08 21:48:43,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:43,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:48:43,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:48:43,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:48:43,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:48:43,806 INFO L87 Difference]: Start difference. First operand has 94 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 21:48:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:43,837 INFO L93 Difference]: Finished difference Result 181 states and 322 transitions. [2024-11-08 21:48:43,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:48:43,840 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 205 [2024-11-08 21:48:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:43,848 INFO L225 Difference]: With dead ends: 181 [2024-11-08 21:48:43,848 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 21:48:43,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 204 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-08 21:48:43,857 INFO L432 NwaCegarLoop]: 141 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, 141 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-08 21:48:43,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:48:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 21:48:43,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 21:48:43,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.375) internal successors, (77), 56 states have internal predecessors, (77), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:48:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 141 transitions. [2024-11-08 21:48:43,918 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 141 transitions. Word has length 205 [2024-11-08 21:48:43,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:43,919 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 141 transitions. [2024-11-08 21:48:43,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-08 21:48:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 141 transitions. [2024-11-08 21:48:43,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-08 21:48:43,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:43,924 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:43,936 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-08 21:48:44,125 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-08 21:48:44,125 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:44,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:44,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1131677042, now seen corresponding path program 1 times [2024-11-08 21:48:44,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:48:44,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033739044] [2024-11-08 21:48:44,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:44,128 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-08 21:48:44,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:48:44,132 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-08 21:48:44,133 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-08 21:48:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:44,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 21:48:44,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-08 21:48:45,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:48:45,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:48:45,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033739044] [2024-11-08 21:48:45,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033739044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:48:45,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:48:45,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:48:45,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554231788] [2024-11-08 21:48:45,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:48:45,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 21:48:45,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:48:45,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 21:48:45,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 21:48:45,040 INFO L87 Difference]: Start difference. First operand 90 states and 141 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:45,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:45,144 INFO L93 Difference]: Finished difference Result 174 states and 273 transitions. [2024-11-08 21:48:45,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 21:48:45,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 205 [2024-11-08 21:48:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:45,161 INFO L225 Difference]: With dead ends: 174 [2024-11-08 21:48:45,162 INFO L226 Difference]: Without dead ends: 87 [2024-11-08 21:48:45,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 203 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-08 21:48:45,164 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:45,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 126 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:48:45,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-08 21:48:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-08 21:48:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-08 21:48:45,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 131 transitions. [2024-11-08 21:48:45,179 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 131 transitions. Word has length 205 [2024-11-08 21:48:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:45,180 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 131 transitions. [2024-11-08 21:48:45,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-08 21:48:45,181 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 131 transitions. [2024-11-08 21:48:45,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 21:48:45,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:45,184 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:45,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-08 21:48:45,385 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-08 21:48:45,386 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:45,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:45,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1624061883, now seen corresponding path program 1 times [2024-11-08 21:48:45,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:48:45,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350404161] [2024-11-08 21:48:45,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:45,388 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-08 21:48:45,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:48:45,391 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-08 21:48:45,392 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-08 21:48:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:45,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 21:48:45,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1098 proven. 120 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2024-11-08 21:48:46,621 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:48:47,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:48:47,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350404161] [2024-11-08 21:48:47,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350404161] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:48:47,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [802391702] [2024-11-08 21:48:47,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:47,415 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 21:48:47,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 21:48:47,418 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-08 21:48:47,419 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-08 21:48:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:48,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 21:48:48,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:48:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 267 proven. 87 refuted. 0 times theorem prover too weak. 1630 trivial. 0 not checked. [2024-11-08 21:48:48,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:48:50,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [802391702] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:48:50,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:48:50,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2024-11-08 21:48:50,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239267934] [2024-11-08 21:48:50,146 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:48:50,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 21:48:50,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:48:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 21:48:50,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-08 21:48:50,150 INFO L87 Difference]: Start difference. First operand 87 states and 131 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 3 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-11-08 21:48:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:48:51,389 INFO L93 Difference]: Finished difference Result 192 states and 279 transitions. [2024-11-08 21:48:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 21:48:51,390 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 3 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 206 [2024-11-08 21:48:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:48:51,392 INFO L225 Difference]: With dead ends: 192 [2024-11-08 21:48:51,392 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 21:48:51,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=297, Unknown=0, NotChecked=0, Total=420 [2024-11-08 21:48:51,398 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 72 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 21:48:51,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 326 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 21:48:51,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 21:48:51,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 103. [2024-11-08 21:48:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.1875) internal successors, (76), 65 states have internal predecessors, (76), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 21:48:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 144 transitions. [2024-11-08 21:48:51,427 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 144 transitions. Word has length 206 [2024-11-08 21:48:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:48:51,427 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 144 transitions. [2024-11-08 21:48:51,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 9 states have internal predecessors, (84), 3 states have call successors, (44), 3 states have call predecessors, (44), 5 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-11-08 21:48:51,428 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 144 transitions. [2024-11-08 21:48:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-11-08 21:48:51,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:48:51,434 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 21:48:51,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-08 21:48:51,645 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-08 21:48:51,834 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-08 21:48:51,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:48:51,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:48:51,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1509803319, now seen corresponding path program 1 times [2024-11-08 21:48:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:48:51,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373359056] [2024-11-08 21:48:51,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:48:51,837 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-08 21:48:51,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:48:51,839 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-08 21:48:51,840 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-08 21:48:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:48:52,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 21:48:52,364 INFO L278 TraceCheckSpWp]: Computing forward predicates...