./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e16c5a025919373f7b296a1dca27c9a462a1ec91557da14151f7e36b86babe44 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:54:05,544 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:54:05,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:54:05,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:54:05,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:54:05,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:54:05,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:54:05,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:54:05,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:54:05,688 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:54:05,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:54:05,689 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:54:05,689 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:54:05,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:54:05,692 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:54:05,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:54:05,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:54:05,693 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:54:05,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:54:05,694 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:54:05,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:54:05,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:54:05,698 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:54:05,698 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:54:05,699 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:54:05,699 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:54:05,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:54:05,699 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:54:05,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:54:05,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:54:05,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:54:05,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:54:05,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:54:05,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:54:05,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:54:05,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:54:05,702 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:54:05,702 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:54:05,702 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:54:05,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:54:05,703 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:54:05,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:54:05,705 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-clean/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-clean/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 -> e16c5a025919373f7b296a1dca27c9a462a1ec91557da14151f7e36b86babe44 [2024-10-11 11:54:05,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:54:06,008 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:54:06,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:54:06,012 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:54:06,013 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:54:06,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-10-11 11:54:07,506 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:54:07,744 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:54:07,744 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-10-11 11:54:07,756 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8cae4f985/c394f2a287eb493997d6a1a505553e5a/FLAGb9672ba38 [2024-10-11 11:54:07,773 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8cae4f985/c394f2a287eb493997d6a1a505553e5a [2024-10-11 11:54:07,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:54:07,777 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:54:07,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:54:07,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:54:07,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:54:07,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:54:07" (1/1) ... [2024-10-11 11:54:07,789 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca2555b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:07, skipping insertion in model container [2024-10-11 11:54:07,790 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:54:07" (1/1) ... [2024-10-11 11:54:07,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:54:07,998 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i[915,928] [2024-10-11 11:54:08,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:54:08,081 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:54:08,093 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i[915,928] [2024-10-11 11:54:08,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:54:08,150 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:54:08,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08 WrapperNode [2024-10-11 11:54:08,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:54:08,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:54:08,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:54:08,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:54:08,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,222 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-10-11 11:54:08,223 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:54:08,224 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:54:08,224 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:54:08,224 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:54:08,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,268 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:54:08,269 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,270 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:54:08,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:54:08,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:54:08,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:54:08,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (1/1) ... [2024-10-11 11:54:08,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:54:08,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:54:08,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:54:08,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:54:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:54:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:54:08,390 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:54:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:54:08,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:54:08,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:54:08,477 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:54:08,479 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:54:08,964 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-11 11:54:08,964 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:54:09,001 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:54:09,001 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:54:09,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:54:09 BoogieIcfgContainer [2024-10-11 11:54:09,002 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:54:09,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:54:09,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:54:09,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:54:09,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:54:07" (1/3) ... [2024-10-11 11:54:09,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd61383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:54:09, skipping insertion in model container [2024-10-11 11:54:09,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:08" (2/3) ... [2024-10-11 11:54:09,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fd61383 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:54:09, skipping insertion in model container [2024-10-11 11:54:09,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:54:09" (3/3) ... [2024-10-11 11:54:09,014 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-10-11 11:54:09,032 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:54:09,033 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:54:09,113 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:54:09,122 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;@3004d287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:54:09,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:54:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 11:54:09,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 11:54:09,144 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:09,145 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:09,145 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:09,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:09,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1247947002, now seen corresponding path program 1 times [2024-10-11 11:54:09,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:09,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206519640] [2024-10-11 11:54:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:09,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:09,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:09,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:54:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:54:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:54:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:54:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 11:54:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:54:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 11:54:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:54:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:54:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:09,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:54:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:10,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 11:54:10,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:10,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:54:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 11:54:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:54:10,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:10,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206519640] [2024-10-11 11:54:10,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206519640] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:10,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:10,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:54:10,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157826617] [2024-10-11 11:54:10,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:10,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:54:10,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:10,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:54:10,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:54:10,061 INFO L87 Difference]: Start difference. First operand has 75 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:10,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:10,136 INFO L93 Difference]: Finished difference Result 149 states and 255 transitions. [2024-10-11 11:54:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:54:10,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-11 11:54:10,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:10,152 INFO L225 Difference]: With dead ends: 149 [2024-10-11 11:54:10,153 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 11:54:10,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 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-10-11 11:54:10,162 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 111 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:10,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 106 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:54:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 11:54:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-11 11:54:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.3673469387755102) internal successors, (67), 49 states have internal predecessors, (67), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 11:54:10,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2024-10-11 11:54:10,223 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 141 [2024-10-11 11:54:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:10,228 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2024-10-11 11:54:10,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:10,229 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2024-10-11 11:54:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-11 11:54:10,232 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:10,232 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:10,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:54:10,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:10,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash -546882424, now seen corresponding path program 1 times [2024-10-11 11:54:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:10,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143926848] [2024-10-11 11:54:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:10,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:54:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:12,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:54:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:54:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:54:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 11:54:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:54:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 11:54:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:54:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:54:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:54:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 11:54:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:54:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 11:54:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:54:12,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:12,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143926848] [2024-10-11 11:54:12,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143926848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:12,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:12,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:54:12,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734583290] [2024-10-11 11:54:12,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:12,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:54:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:12,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:54:12,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:54:12,980 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:14,029 INFO L93 Difference]: Finished difference Result 178 states and 265 transitions. [2024-10-11 11:54:14,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:54:14,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 141 [2024-10-11 11:54:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:14,035 INFO L225 Difference]: With dead ends: 178 [2024-10-11 11:54:14,035 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 11:54:14,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:54:14,037 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 37 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:14,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 409 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 11:54:14,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 11:54:14,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-11 11:54:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 75 states have internal predecessors, (100), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:54:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 152 transitions. [2024-10-11 11:54:14,063 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 152 transitions. Word has length 141 [2024-10-11 11:54:14,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:14,064 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 152 transitions. [2024-10-11 11:54:14,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:14,065 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 152 transitions. [2024-10-11 11:54:14,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 11:54:14,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:14,067 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:14,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:54:14,068 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:14,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:14,068 INFO L85 PathProgramCache]: Analyzing trace with hash 348020679, now seen corresponding path program 1 times [2024-10-11 11:54:14,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:14,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648733603] [2024-10-11 11:54:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:14,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:14,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:17,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:17,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:18,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:54:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:54:18,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:54:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:54:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 11:54:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:54:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 11:54:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:54:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:54:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:54:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 11:54:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:54:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 11:54:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:54:18,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:18,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648733603] [2024-10-11 11:54:18,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648733603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:18,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:18,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:54:18,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375119112] [2024-10-11 11:54:18,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:18,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:54:18,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:18,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:54:18,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:54:18,065 INFO L87 Difference]: Start difference. First operand 103 states and 152 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:19,015 INFO L93 Difference]: Finished difference Result 243 states and 351 transitions. [2024-10-11 11:54:19,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:54:19,016 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-11 11:54:19,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:19,019 INFO L225 Difference]: With dead ends: 243 [2024-10-11 11:54:19,020 INFO L226 Difference]: Without dead ends: 141 [2024-10-11 11:54:19,021 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:54:19,021 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 43 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:19,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 423 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 11:54:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-11 11:54:19,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-10-11 11:54:19,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 105 states have internal predecessors, (136), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-11 11:54:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 196 transitions. [2024-10-11 11:54:19,045 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 196 transitions. Word has length 142 [2024-10-11 11:54:19,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:19,046 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 196 transitions. [2024-10-11 11:54:19,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:19,046 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 196 transitions. [2024-10-11 11:54:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-11 11:54:19,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:19,049 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:19,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:54:19,049 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:19,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:19,050 INFO L85 PathProgramCache]: Analyzing trace with hash -238785335, now seen corresponding path program 1 times [2024-10-11 11:54:19,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:19,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813392078] [2024-10-11 11:54:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:19,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:19,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:54:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:54:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:54:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:54:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 11:54:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:54:19,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 11:54:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:54:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:54:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:54:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 11:54:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:54:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 11:54:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:54:19,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:19,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813392078] [2024-10-11 11:54:19,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813392078] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:19,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:19,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:54:19,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132553325] [2024-10-11 11:54:19,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:19,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:54:19,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:19,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:54:19,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:54:19,674 INFO L87 Difference]: Start difference. First operand 137 states and 196 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:19,922 INFO L93 Difference]: Finished difference Result 274 states and 389 transitions. [2024-10-11 11:54:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:54:19,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-10-11 11:54:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:19,928 INFO L225 Difference]: With dead ends: 274 [2024-10-11 11:54:19,928 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 11:54:19,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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-10-11 11:54:19,931 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 64 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:19,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 399 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:54:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 11:54:19,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 114. [2024-10-11 11:54:19,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 81 states have (on average 1.308641975308642) internal successors, (106), 83 states have internal predecessors, (106), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:54:19,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 162 transitions. [2024-10-11 11:54:19,962 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 162 transitions. Word has length 142 [2024-10-11 11:54:19,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:19,963 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 162 transitions. [2024-10-11 11:54:19,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 162 transitions. [2024-10-11 11:54:19,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 11:54:19,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:19,965 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:19,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:54:19,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:19,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:19,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2092140653, now seen corresponding path program 1 times [2024-10-11 11:54:19,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:19,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525851313] [2024-10-11 11:54:19,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:19,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:54:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:54:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:54:23,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:54:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 11:54:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:54:23,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 11:54:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:54:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:54:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:54:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 11:54:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:54:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 11:54:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:23,511 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:54:23,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:23,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525851313] [2024-10-11 11:54:23,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525851313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:23,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:23,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 11:54:23,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253579275] [2024-10-11 11:54:23,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:23,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:54:23,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:23,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:54:23,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:54:23,514 INFO L87 Difference]: Start difference. First operand 114 states and 162 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:24,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:24,881 INFO L93 Difference]: Finished difference Result 313 states and 442 transitions. [2024-10-11 11:54:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:54:24,882 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-11 11:54:24,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:24,886 INFO L225 Difference]: With dead ends: 313 [2024-10-11 11:54:24,886 INFO L226 Difference]: Without dead ends: 207 [2024-10-11 11:54:24,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:54:24,889 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 92 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:24,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 449 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 11:54:24,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-10-11 11:54:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 145. [2024-10-11 11:54:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:54:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-11 11:54:24,917 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-11 11:54:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:24,918 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-11 11:54:24,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-11 11:54:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 11:54:24,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:24,920 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:24,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:54:24,920 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:24,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1699113643, now seen corresponding path program 1 times [2024-10-11 11:54:24,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:24,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769531653] [2024-10-11 11:54:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:24,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:27,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:54:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:54:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:54:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:54:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 11:54:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:54:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 11:54:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:54:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:54:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:54:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 11:54:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:54:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 11:54:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:54:27,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:27,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769531653] [2024-10-11 11:54:27,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769531653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:27,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:27,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 11:54:27,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42445576] [2024-10-11 11:54:27,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:27,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:54:27,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:27,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:54:27,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:54:27,785 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:28,788 INFO L93 Difference]: Finished difference Result 372 states and 519 transitions. [2024-10-11 11:54:28,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 11:54:28,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-11 11:54:28,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:28,791 INFO L225 Difference]: With dead ends: 372 [2024-10-11 11:54:28,791 INFO L226 Difference]: Without dead ends: 235 [2024-10-11 11:54:28,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-10-11 11:54:28,796 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 95 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:28,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 564 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 11:54:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-10-11 11:54:28,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 149. [2024-10-11 11:54:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 116 states have (on average 1.3362068965517242) internal successors, (155), 118 states have internal predecessors, (155), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:54:28,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 211 transitions. [2024-10-11 11:54:28,836 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 211 transitions. Word has length 143 [2024-10-11 11:54:28,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:28,838 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 211 transitions. [2024-10-11 11:54:28,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 211 transitions. [2024-10-11 11:54:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 11:54:28,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:28,840 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:28,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:54:28,840 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:28,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1957279081, now seen corresponding path program 1 times [2024-10-11 11:54:28,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:28,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239929983] [2024-10-11 11:54:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:28,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:54:30,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:54:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:54:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:54:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 11:54:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:54:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 11:54:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:54:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:54:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:54:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 11:54:30,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:54:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 11:54:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:54:30,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:30,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239929983] [2024-10-11 11:54:30,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239929983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:30,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:30,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 11:54:30,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388126558] [2024-10-11 11:54:30,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:30,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 11:54:30,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:30,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 11:54:30,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-11 11:54:30,805 INFO L87 Difference]: Start difference. First operand 149 states and 211 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:31,653 INFO L93 Difference]: Finished difference Result 370 states and 517 transitions. [2024-10-11 11:54:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 11:54:31,655 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-10-11 11:54:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:31,657 INFO L225 Difference]: With dead ends: 370 [2024-10-11 11:54:31,657 INFO L226 Difference]: Without dead ends: 229 [2024-10-11 11:54:31,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-11 11:54:31,658 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 80 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:31,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 509 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 11:54:31,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-10-11 11:54:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 145. [2024-10-11 11:54:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.3303571428571428) internal successors, (149), 114 states have internal predecessors, (149), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:54:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 205 transitions. [2024-10-11 11:54:31,685 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 205 transitions. Word has length 143 [2024-10-11 11:54:31,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:31,685 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 205 transitions. [2024-10-11 11:54:31,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 205 transitions. [2024-10-11 11:54:31,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 11:54:31,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:31,687 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:31,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:54:31,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:31,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:31,688 INFO L85 PathProgramCache]: Analyzing trace with hash -653557592, now seen corresponding path program 1 times [2024-10-11 11:54:31,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:31,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409640808] [2024-10-11 11:54:31,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:31,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:31,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:54:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:31,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:54:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:54:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:54:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 11:54:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:54:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 11:54:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:54:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:54:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:54:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 11:54:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:54:31,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 11:54:31,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:31,804 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:54:31,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:31,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409640808] [2024-10-11 11:54:31,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409640808] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:31,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:31,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:54:31,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017443705] [2024-10-11 11:54:31,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:31,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:54:31,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:31,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:54:31,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:54:31,806 INFO L87 Difference]: Start difference. First operand 145 states and 205 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:31,926 INFO L93 Difference]: Finished difference Result 345 states and 485 transitions. [2024-10-11 11:54:31,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:54:31,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-11 11:54:31,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:31,929 INFO L225 Difference]: With dead ends: 345 [2024-10-11 11:54:31,929 INFO L226 Difference]: Without dead ends: 208 [2024-10-11 11:54:31,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-10-11 11:54:31,930 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 37 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:31,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 156 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:54:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-10-11 11:54:31,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 180. [2024-10-11 11:54:31,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 149 states have internal predecessors, (196), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 11:54:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 252 transitions. [2024-10-11 11:54:31,952 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 252 transitions. Word has length 144 [2024-10-11 11:54:31,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:31,953 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 252 transitions. [2024-10-11 11:54:31,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:31,953 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 252 transitions. [2024-10-11 11:54:31,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 11:54:31,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:31,954 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:31,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:54:31,954 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:31,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:31,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1293603766, now seen corresponding path program 1 times [2024-10-11 11:54:31,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:31,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016127707] [2024-10-11 11:54:31,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:31,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:32,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:54:32,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:54:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:54:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:54:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 11:54:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:54:32,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 11:54:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:54:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:54:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:54:32,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 11:54:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:54:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 11:54:32,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,170 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:54:32,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:32,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016127707] [2024-10-11 11:54:32,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016127707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:32,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:32,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:54:32,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028244179] [2024-10-11 11:54:32,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:32,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:54:32,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:32,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:54:32,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:54:32,173 INFO L87 Difference]: Start difference. First operand 180 states and 252 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:32,369 INFO L93 Difference]: Finished difference Result 503 states and 704 transitions. [2024-10-11 11:54:32,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:54:32,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-11 11:54:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:32,372 INFO L225 Difference]: With dead ends: 503 [2024-10-11 11:54:32,372 INFO L226 Difference]: Without dead ends: 324 [2024-10-11 11:54:32,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 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-10-11 11:54:32,373 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 84 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:32,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 362 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:54:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-10-11 11:54:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 227. [2024-10-11 11:54:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 169 states have (on average 1.2958579881656804) internal successors, (219), 171 states have internal predecessors, (219), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 11:54:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 319 transitions. [2024-10-11 11:54:32,419 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 319 transitions. Word has length 144 [2024-10-11 11:54:32,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:32,419 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 319 transitions. [2024-10-11 11:54:32,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 319 transitions. [2024-10-11 11:54:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 11:54:32,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:32,421 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:32,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 11:54:32,421 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:32,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:32,422 INFO L85 PathProgramCache]: Analyzing trace with hash -303359268, now seen corresponding path program 1 times [2024-10-11 11:54:32,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:32,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281460691] [2024-10-11 11:54:32,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:32,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 11:54:32,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 11:54:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 11:54:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 11:54:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 11:54:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:54:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 11:54:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 11:54:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 11:54:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 11:54:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 11:54:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 11:54:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 11:54:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:54:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:32,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281460691] [2024-10-11 11:54:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281460691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:32,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:54:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793115992] [2024-10-11 11:54:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:32,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:54:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:32,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:54:32,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:54:32,517 INFO L87 Difference]: Start difference. First operand 227 states and 319 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:32,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:32,643 INFO L93 Difference]: Finished difference Result 431 states and 598 transitions. [2024-10-11 11:54:32,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:54:32,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-11 11:54:32,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:32,646 INFO L225 Difference]: With dead ends: 431 [2024-10-11 11:54:32,646 INFO L226 Difference]: Without dead ends: 252 [2024-10-11 11:54:32,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-10-11 11:54:32,647 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 42 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:32,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 177 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:54:32,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-11 11:54:32,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 214. [2024-10-11 11:54:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 158 states have (on average 1.2784810126582278) internal successors, (202), 159 states have internal predecessors, (202), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 11:54:32,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 298 transitions. [2024-10-11 11:54:32,676 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 298 transitions. Word has length 144 [2024-10-11 11:54:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:32,677 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 298 transitions. [2024-10-11 11:54:32,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:32,677 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 298 transitions. [2024-10-11 11:54:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 11:54:32,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:32,678 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:32,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 11:54:32,678 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:32,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash -13967790, now seen corresponding path program 1 times [2024-10-11 11:54:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838596508] [2024-10-11 11:54:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:32,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:54:32,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44748348] [2024-10-11 11:54:32,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:32,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:54:32,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:54:32,770 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:54:32,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:54:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:54:33,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:54:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:54:33,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:54:33,321 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:54:33,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:54:33,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:54:33,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 11:54:33,529 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:33,641 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:54:33,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:54:33 BoogieIcfgContainer [2024-10-11 11:54:33,647 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:54:33,647 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:54:33,647 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:54:33,647 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:54:33,648 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:54:09" (3/4) ... [2024-10-11 11:54:33,650 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:54:33,651 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:54:33,652 INFO L158 Benchmark]: Toolchain (without parser) took 25874.90ms. Allocated memory was 157.3MB in the beginning and 459.3MB in the end (delta: 302.0MB). Free memory was 102.0MB in the beginning and 328.5MB in the end (delta: -226.5MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2024-10-11 11:54:33,652 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 157.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:54:33,652 INFO L158 Benchmark]: CACSL2BoogieTranslator took 375.72ms. Allocated memory is still 157.3MB. Free memory was 101.6MB in the beginning and 86.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 11:54:33,653 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.78ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 82.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:54:33,653 INFO L158 Benchmark]: Boogie Preprocessor took 71.00ms. Allocated memory is still 157.3MB. Free memory was 82.3MB in the beginning and 77.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 11:54:33,653 INFO L158 Benchmark]: RCFGBuilder took 706.30ms. Allocated memory is still 157.3MB. Free memory was 77.2MB in the beginning and 111.9MB in the end (delta: -34.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-10-11 11:54:33,654 INFO L158 Benchmark]: TraceAbstraction took 24642.65ms. Allocated memory was 157.3MB in the beginning and 459.3MB in the end (delta: 302.0MB). Free memory was 111.1MB in the beginning and 328.5MB in the end (delta: -217.4MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2024-10-11 11:54:33,654 INFO L158 Benchmark]: Witness Printer took 4.27ms. Allocated memory is still 459.3MB. Free memory is still 328.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:54:33,655 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 157.3MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 375.72ms. Allocated memory is still 157.3MB. Free memory was 101.6MB in the beginning and 86.1MB in the end (delta: 15.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.78ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 82.3MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.00ms. Allocated memory is still 157.3MB. Free memory was 82.3MB in the beginning and 77.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 706.30ms. Allocated memory is still 157.3MB. Free memory was 77.2MB in the beginning and 111.9MB in the end (delta: -34.7MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 24642.65ms. Allocated memory was 157.3MB in the beginning and 459.3MB in the end (delta: 302.0MB). Free memory was 111.1MB in the beginning and 328.5MB in the end (delta: -217.4MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. * Witness Printer took 4.27ms. Allocated memory is still 459.3MB. Free memory is still 328.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 119. 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] unsigned short int last_1_var_1_15 = 128; [L123] isInitial = 1 [L124] FCALL initially() [L125] int k_loop; [L126] k_loop = 0 VAL [isInitial=1, k_loop=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_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L126] COND TRUE k_loop < 1 [L127] CALL updateLastVariables() [L116] last_1_var_1_15 = var_1_15 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L82] var_1_3 = __VERIFIER_nondet_char() [L83] 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_3=-62, 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_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] 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_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] 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_3=-62, 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_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] 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_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] var_1_4 = __VERIFIER_nondet_char() [L86] 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_3=-62, 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_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] 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_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] 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_3=-62, 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_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] 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_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] 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_3=-62, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] 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_3=-62, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] var_1_7 = __VERIFIER_nondet_long() [L92] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L92] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L93] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L93] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L94] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L94] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L95] var_1_8 = __VERIFIER_nondet_long() [L96] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L96] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L97] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L97] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L98] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L98] 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L99] var_1_10 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L100] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L101] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L102] var_1_11 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L103] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L104] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L105] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L105] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L106] var_1_16 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L107] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L108] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L108] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, 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_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L109] var_1_17 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L110] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L111] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L111] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L112] var_1_21 = __VERIFIER_nondet_double() [L113] 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L113] 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L128] RET updateVariables() [L129] CALL step() [L45] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L45] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L50] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L52] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L52] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L53] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L54] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L58] signed long int stepLocal_1 = -4; [L59] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L60] 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=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L65] var_1_18 = var_1_17 [L66] var_1_19 = 0 [L67] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L68] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L71] COND TRUE var_1_3 <= var_1_1 [L72] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L76] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32768, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L77] COND TRUE (~ var_1_3) < stepLocal_2 [L78] 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L129] RET step() [L130] CALL, EXPR property() [L119] 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119] 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=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L119-L120] 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)) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=384, var_1_11=258, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=1, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.4s, OverallIterations: 11, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 685 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 685 mSDsluCounter, 3554 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2578 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1876 IncrementalHoareTripleChecker+Invalid, 1968 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 976 mSDtfsCounter, 1876 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 521 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=9, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 433 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 16.4s InterpolantComputationTime, 1717 NumberOfCodeBlocks, 1717 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 9738 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 9240/9240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:54:33,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e16c5a025919373f7b296a1dca27c9a462a1ec91557da14151f7e36b86babe44 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:54:35,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:54:36,018 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:54:36,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:54:36,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:54:36,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:54:36,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:54:36,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:54:36,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:54:36,062 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:54:36,062 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:54:36,062 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:54:36,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:54:36,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:54:36,067 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:54:36,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:54:36,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:54:36,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:54:36,068 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:54:36,068 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:54:36,068 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:54:36,069 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:54:36,069 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:54:36,069 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:54:36,069 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:54:36,070 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:54:36,070 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:54:36,070 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:54:36,070 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:54:36,070 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:54:36,071 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:54:36,071 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:54:36,071 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:54:36,071 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:54:36,071 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:54:36,072 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:54:36,072 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:54:36,072 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:54:36,074 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:54:36,074 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:54:36,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:54:36,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:54:36,075 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:54:36,075 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:54:36,075 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:54:36,076 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-clean/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-clean/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 -> e16c5a025919373f7b296a1dca27c9a462a1ec91557da14151f7e36b86babe44 [2024-10-11 11:54:36,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:54:36,451 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:54:36,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:54:36,454 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:54:36,455 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:54:36,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-10-11 11:54:38,045 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:54:38,247 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:54:38,248 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-10-11 11:54:38,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/16edad9d7/a80d08e2113e425ca9d09f2782ba1ad2/FLAG533835786 [2024-10-11 11:54:38,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/16edad9d7/a80d08e2113e425ca9d09f2782ba1ad2 [2024-10-11 11:54:38,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:54:38,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:54:38,278 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:54:38,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:54:38,285 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:54:38,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b24698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38, skipping insertion in model container [2024-10-11 11:54:38,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,335 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:54:38,522 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i[915,928] [2024-10-11 11:54:38,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:54:38,631 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:54:38,644 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-84.i[915,928] [2024-10-11 11:54:38,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:54:38,710 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:54:38,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38 WrapperNode [2024-10-11 11:54:38,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:54:38,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:54:38,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:54:38,712 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:54:38,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,767 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2024-10-11 11:54:38,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:54:38,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:54:38,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:54:38,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:54:38,780 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,786 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,804 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:54:38,804 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,812 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:54:38,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:54:38,827 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:54:38,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:54:38,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (1/1) ... [2024-10-11 11:54:38,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:54:38,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:54:38,861 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:54:38,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:54:38,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:54:38,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:54:38,914 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:54:38,914 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:54:38,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:54:38,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:54:39,021 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:54:39,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:54:39,456 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 11:54:39,457 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:54:39,530 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:54:39,530 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:54:39,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:54:39 BoogieIcfgContainer [2024-10-11 11:54:39,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:54:39,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:54:39,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:54:39,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:54:39,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:54:38" (1/3) ... [2024-10-11 11:54:39,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92c872a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:54:39, skipping insertion in model container [2024-10-11 11:54:39,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:38" (2/3) ... [2024-10-11 11:54:39,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92c872a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:54:39, skipping insertion in model container [2024-10-11 11:54:39,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:54:39" (3/3) ... [2024-10-11 11:54:39,541 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-84.i [2024-10-11 11:54:39,559 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:54:39,574 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:54:39,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:54:39,656 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;@5fa9ba2e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:54:39,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:54:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 11:54:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 11:54:39,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:39,677 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:39,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:39,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash -120589560, now seen corresponding path program 1 times [2024-10-11 11:54:39,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:54:39,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503662399] [2024-10-11 11:54:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:39,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:54:39,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:54:39,704 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:54:39,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:54:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:39,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 11:54:39,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:54:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-11 11:54:40,052 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:54:40,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:54:40,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503662399] [2024-10-11 11:54:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [503662399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:40,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:40,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:54:40,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256993258] [2024-10-11 11:54:40,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:40,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:54:40,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:54:40,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:54:40,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:54:40,097 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 1.40625) internal successors, (45), 33 states have internal predecessors, (45), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:40,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:40,232 INFO L93 Difference]: Finished difference Result 113 states and 199 transitions. [2024-10-11 11:54:40,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:54:40,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 135 [2024-10-11 11:54:40,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:40,249 INFO L225 Difference]: With dead ends: 113 [2024-10-11 11:54:40,249 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 11:54:40,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 133 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-10-11 11:54:40,258 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:40,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 79 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:54:40,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 11:54:40,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-11 11:54:40,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-11 11:54:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 83 transitions. [2024-10-11 11:54:40,317 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 83 transitions. Word has length 135 [2024-10-11 11:54:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:40,319 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 83 transitions. [2024-10-11 11:54:40,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-11 11:54:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 83 transitions. [2024-10-11 11:54:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 11:54:40,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:40,324 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:40,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:54:40,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:54:40,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:40,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:40,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1654417802, now seen corresponding path program 1 times [2024-10-11 11:54:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:54:40,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88716501] [2024-10-11 11:54:40,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:40,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:54:40,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:54:40,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:54:40,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:54:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:40,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-11 11:54:40,811 INFO L278 TraceCheckSpWp]: Computing forward predicates...