./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_25-1loop_file-87.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_25-1loop_file-87.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 1d6740d93249b8004eae6c6ec99a57fdd342d0b18a807811334b011905a57c0b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:32:45,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:32:45,401 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:32:45,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:32:45,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:32:45,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:32:45,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:32:45,441 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:32:45,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:32:45,443 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:32:45,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:32:45,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:32:45,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:32:45,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:32:45,446 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:32:45,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:32:45,450 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:32:45,450 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:32:45,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:32:45,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:32:45,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:32:45,452 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:32:45,452 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:32:45,452 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:32:45,453 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:32:45,453 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:32:45,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:32:45,453 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:32:45,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:32:45,454 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:32:45,454 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:32:45,454 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:32:45,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:32:45,455 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:32:45,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:32:45,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:32:45,459 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:32:45,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:32:45,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:32:45,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:32:45,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:32:45,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:32:45,460 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 -> 1d6740d93249b8004eae6c6ec99a57fdd342d0b18a807811334b011905a57c0b [2024-10-11 11:32:45,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:32:45,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:32:45,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:32:45,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:32:45,732 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:32:45,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-87.i [2024-10-11 11:32:47,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:32:47,416 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:32:47,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-87.i [2024-10-11 11:32:47,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ca85e00b6/71542c5c39f24ba5930bd02461d5a52a/FLAG30f0170fc [2024-10-11 11:32:47,437 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ca85e00b6/71542c5c39f24ba5930bd02461d5a52a [2024-10-11 11:32:47,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:32:47,441 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:32:47,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:32:47,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:32:47,448 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:32:47,449 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,449 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d0a5a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47, skipping insertion in model container [2024-10-11 11:32:47,450 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:32:47,632 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_25-1loop_file-87.i[915,928] [2024-10-11 11:32:47,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:32:47,677 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:32:47,687 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_25-1loop_file-87.i[915,928] [2024-10-11 11:32:47,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:32:47,729 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:32:47,730 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47 WrapperNode [2024-10-11 11:32:47,730 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:32:47,731 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:32:47,731 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:32:47,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:32:47,737 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:32:47" (1/1) ... [2024-10-11 11:32:47,744 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:32:47" (1/1) ... [2024-10-11 11:32:47,792 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2024-10-11 11:32:47,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:32:47,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:32:47,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:32:47,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:32:47,806 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,848 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:32:47,849 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,862 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,866 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:32:47,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:32:47,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:32:47,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:32:47,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47" (1/1) ... [2024-10-11 11:32:47,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:32:47,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:32:47,904 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:32:47,907 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:32:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:32:47,958 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:32:47,959 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:32:47,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:32:47,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:32:47,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:32:48,041 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:32:48,044 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:32:48,335 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-10-11 11:32:48,335 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:32:48,372 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:32:48,372 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:32:48,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:32:48 BoogieIcfgContainer [2024-10-11 11:32:48,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:32:48,375 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:32:48,375 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:32:48,380 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:32:48,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:32:47" (1/3) ... [2024-10-11 11:32:48,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dfd391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:32:48, skipping insertion in model container [2024-10-11 11:32:48,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:32:47" (2/3) ... [2024-10-11 11:32:48,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9dfd391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:32:48, skipping insertion in model container [2024-10-11 11:32:48,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:32:48" (3/3) ... [2024-10-11 11:32:48,385 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-87.i [2024-10-11 11:32:48,401 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:32:48,402 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:32:48,471 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:32:48,479 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;@2d4b98e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:32:48,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:32:48,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 11:32:48,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:32:48,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:32:48,495 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:48,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:32:48,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:32:48,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1362884989, now seen corresponding path program 1 times [2024-10-11 11:32:48,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:32:48,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681156717] [2024-10-11 11:32:48,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:32:48,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:32:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:32:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:32:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:32:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:32:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:32:48,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:32:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:32:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:32:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:32:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:32:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:32:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:32:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:32:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:32:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:48,873 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:32:48,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:32:48,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681156717] [2024-10-11 11:32:48,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681156717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:32:48,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:32:48,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:32:48,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181833234] [2024-10-11 11:32:48,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:32:48,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:32:48,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:32:48,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:32:48,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:32:48,909 INFO L87 Difference]: Start difference. First operand has 51 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 11:32:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:32:48,955 INFO L93 Difference]: Finished difference Result 101 states and 167 transitions. [2024-10-11 11:32:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:32:48,959 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 92 [2024-10-11 11:32:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:32:48,969 INFO L225 Difference]: With dead ends: 101 [2024-10-11 11:32:48,969 INFO L226 Difference]: Without dead ends: 49 [2024-10-11 11:32:48,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:32:48,977 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:32:48,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:32:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-11 11:32:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-11 11:32:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 11:32:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 72 transitions. [2024-10-11 11:32:49,023 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 72 transitions. Word has length 92 [2024-10-11 11:32:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:32:49,023 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 72 transitions. [2024-10-11 11:32:49,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 11:32:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 72 transitions. [2024-10-11 11:32:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 11:32:49,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:32:49,031 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:49,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:32:49,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:32:49,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:32:49,033 INFO L85 PathProgramCache]: Analyzing trace with hash 518919553, now seen corresponding path program 1 times [2024-10-11 11:32:49,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:32:49,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016901958] [2024-10-11 11:32:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:32:49,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:32:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:32:58,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:32:58,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:32:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:32:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:32:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:32:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:32:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:32:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:32:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:32:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:32:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:32:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:32:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:32:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:32:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:32:58,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:32:58,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016901958] [2024-10-11 11:32:58,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016901958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:32:58,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:32:58,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:32:58,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999313491] [2024-10-11 11:32:58,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:32:58,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:32:58,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:32:58,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:32:58,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:32:58,634 INFO L87 Difference]: Start difference. First operand 49 states and 72 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:32:58,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:32:58,836 INFO L93 Difference]: Finished difference Result 116 states and 169 transitions. [2024-10-11 11:32:58,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:32:58,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 92 [2024-10-11 11:32:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:32:58,839 INFO L225 Difference]: With dead ends: 116 [2024-10-11 11:32:58,839 INFO L226 Difference]: Without dead ends: 68 [2024-10-11 11:32:58,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:32:58,843 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 61 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:32:58,843 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 173 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:32:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-11 11:32:58,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2024-10-11 11:32:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 43 states have (on average 1.372093023255814) internal successors, (59), 43 states have internal predecessors, (59), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 11:32:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-10-11 11:32:58,861 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 92 [2024-10-11 11:32:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:32:58,863 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-10-11 11:32:58,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:32:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-10-11 11:32:58,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 11:32:58,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:32:58,869 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:58,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:32:58,869 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:32:58,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:32:58,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1222720418, now seen corresponding path program 1 times [2024-10-11 11:32:58,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:32:58,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935334974] [2024-10-11 11:32:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:32:58,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:32:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:33:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:33:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:33:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:33:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:33:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:33:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:33:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:33:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:33:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:33:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:33:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:33:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:33:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:33:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:33:24,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:33:24,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935334974] [2024-10-11 11:33:24,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935334974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:33:24,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:33:24,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 11:33:24,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62702471] [2024-10-11 11:33:24,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:24,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:33:24,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:33:24,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:33:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:33:24,925 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:33:25,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:25,757 INFO L93 Difference]: Finished difference Result 193 states and 277 transitions. [2024-10-11 11:33:25,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:33:25,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-11 11:33:25,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:25,763 INFO L225 Difference]: With dead ends: 193 [2024-10-11 11:33:25,765 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 11:33:25,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:33:25,767 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 123 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:25,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 290 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:33:25,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 11:33:25,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 64. [2024-10-11 11:33:25,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 48 states have internal predecessors, (67), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 11:33:25,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 95 transitions. [2024-10-11 11:33:25,786 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 95 transitions. Word has length 93 [2024-10-11 11:33:25,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:25,787 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 95 transitions. [2024-10-11 11:33:25,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:33:25,787 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 95 transitions. [2024-10-11 11:33:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 11:33:25,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:25,789 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:25,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:33:25,789 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:25,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:25,790 INFO L85 PathProgramCache]: Analyzing trace with hash -521655840, now seen corresponding path program 1 times [2024-10-11 11:33:25,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:25,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746733245] [2024-10-11 11:33:25,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:25,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:33:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:33:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:33:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:33:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:33:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:33:26,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:33:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:33:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:33:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:33:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:33:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:33:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:33:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:33:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:26,114 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:33:26,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:33:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746733245] [2024-10-11 11:33:26,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746733245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:33:26,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:33:26,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:33:26,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340122352] [2024-10-11 11:33:26,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:26,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:33:26,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:33:26,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:33:26,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:33:26,117 INFO L87 Difference]: Start difference. First operand 64 states and 95 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:33:26,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:26,401 INFO L93 Difference]: Finished difference Result 187 states and 269 transitions. [2024-10-11 11:33:26,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:33:26,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-11 11:33:26,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:26,403 INFO L225 Difference]: With dead ends: 187 [2024-10-11 11:33:26,403 INFO L226 Difference]: Without dead ends: 124 [2024-10-11 11:33:26,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:33:26,405 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 64 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:26,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 304 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:33:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-10-11 11:33:26,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 106. [2024-10-11 11:33:26,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 88 states have internal predecessors, (123), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 11:33:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 155 transitions. [2024-10-11 11:33:26,422 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 155 transitions. Word has length 93 [2024-10-11 11:33:26,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:26,423 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 155 transitions. [2024-10-11 11:33:26,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:33:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 155 transitions. [2024-10-11 11:33:26,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 11:33:26,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:26,425 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:26,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:33:26,425 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:26,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:26,426 INFO L85 PathProgramCache]: Analyzing trace with hash 2061129628, now seen corresponding path program 1 times [2024-10-11 11:33:26,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:26,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507391453] [2024-10-11 11:33:26,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:26,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:33:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:33:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:33:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:33:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:33:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:33:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:33:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:33:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:33:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:33:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:33:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:33:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:33:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:33:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:33:35,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:33:35,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507391453] [2024-10-11 11:33:35,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507391453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:33:35,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:33:35,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 11:33:35,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006828314] [2024-10-11 11:33:35,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:35,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 11:33:35,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:33:35,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 11:33:35,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:33:35,696 INFO L87 Difference]: Start difference. First operand 106 states and 155 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:33:36,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:36,141 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2024-10-11 11:33:36,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 11:33:36,141 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-11 11:33:36,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:36,144 INFO L225 Difference]: With dead ends: 304 [2024-10-11 11:33:36,145 INFO L226 Difference]: Without dead ends: 199 [2024-10-11 11:33:36,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:33:36,146 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 94 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:36,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 318 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 11:33:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-11 11:33:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 169. [2024-10-11 11:33:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 132 states have (on average 1.393939393939394) internal successors, (184), 134 states have internal predecessors, (184), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 11:33:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 248 transitions. [2024-10-11 11:33:36,187 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 248 transitions. Word has length 93 [2024-10-11 11:33:36,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:36,188 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 248 transitions. [2024-10-11 11:33:36,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:33:36,188 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 248 transitions. [2024-10-11 11:33:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 11:33:36,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:36,190 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:36,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:33:36,190 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:36,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:36,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1532773090, now seen corresponding path program 1 times [2024-10-11 11:33:36,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:36,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114868270] [2024-10-11 11:33:36,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:36,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:33:36,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:33:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:33:36,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:33:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:33:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:33:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:33:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:33:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:33:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:33:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:33:36,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:33:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:33:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:33:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:33:36,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:33:36,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114868270] [2024-10-11 11:33:36,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114868270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:33:36,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:33:36,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:33:36,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733979873] [2024-10-11 11:33:36,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:36,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:33:36,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:33:36,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:33:36,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:33:36,389 INFO L87 Difference]: Start difference. First operand 169 states and 248 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:33:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:36,493 INFO L93 Difference]: Finished difference Result 322 states and 472 transitions. [2024-10-11 11:33:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:33:36,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-11 11:33:36,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:36,496 INFO L225 Difference]: With dead ends: 322 [2024-10-11 11:33:36,496 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 11:33:36,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:33:36,498 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 45 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:36,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 291 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:33:36,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 11:33:36,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-10-11 11:33:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 122 states have (on average 1.3688524590163935) internal successors, (167), 124 states have internal predecessors, (167), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 11:33:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 231 transitions. [2024-10-11 11:33:36,520 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 231 transitions. Word has length 93 [2024-10-11 11:33:36,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:36,520 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 231 transitions. [2024-10-11 11:33:36,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:33:36,521 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 231 transitions. [2024-10-11 11:33:36,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 11:33:36,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:36,522 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:36,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:33:36,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:36,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:36,523 INFO L85 PathProgramCache]: Analyzing trace with hash 112488262, now seen corresponding path program 1 times [2024-10-11 11:33:36,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:36,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116872086] [2024-10-11 11:33:36,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:36,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:33:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:33:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:33:43,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:33:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:33:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:33:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:33:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:33:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:33:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:33:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:33:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:33:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:33:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:33:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:33:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:33:43,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:33:43,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116872086] [2024-10-11 11:33:43,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116872086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:33:43,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:33:43,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 11:33:43,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346210615] [2024-10-11 11:33:43,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:33:43,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 11:33:43,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:33:43,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 11:33:43,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 11:33:43,776 INFO L87 Difference]: Start difference. First operand 159 states and 231 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:33:45,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:33:45,902 INFO L93 Difference]: Finished difference Result 243 states and 342 transitions. [2024-10-11 11:33:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:33:45,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-11 11:33:45,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:33:45,905 INFO L225 Difference]: With dead ends: 243 [2024-10-11 11:33:45,905 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 11:33:45,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 11:33:45,906 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 27 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:33:45,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 310 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 11:33:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 11:33:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 233. [2024-10-11 11:33:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 183 states have (on average 1.3278688524590163) internal successors, (243), 188 states have internal predecessors, (243), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 11:33:45,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 327 transitions. [2024-10-11 11:33:45,953 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 327 transitions. Word has length 94 [2024-10-11 11:33:45,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:33:45,953 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 327 transitions. [2024-10-11 11:33:45,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:33:45,954 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 327 transitions. [2024-10-11 11:33:45,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 11:33:45,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:33:45,955 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:45,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:33:45,955 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:33:45,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:33:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash -150044162, now seen corresponding path program 1 times [2024-10-11 11:33:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:33:45,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892596689] [2024-10-11 11:33:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:33:45,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:33:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:34:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:34:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:34:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:34:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:34:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:34:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:34:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:34:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:34:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:34:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:34:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:34:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:34:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:34:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:34:01,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:34:01,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892596689] [2024-10-11 11:34:01,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892596689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:34:01,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:34:01,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:34:01,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351866015] [2024-10-11 11:34:01,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:34:01,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:34:01,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:34:01,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:34:01,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:34:01,413 INFO L87 Difference]: Start difference. First operand 233 states and 327 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:34:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:34:02,257 INFO L93 Difference]: Finished difference Result 419 states and 584 transitions. [2024-10-11 11:34:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:34:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-11 11:34:02,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:34:02,259 INFO L225 Difference]: With dead ends: 419 [2024-10-11 11:34:02,259 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 11:34:02,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:34:02,261 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 48 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:34:02,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 300 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:34:02,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 11:34:02,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 223. [2024-10-11 11:34:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 173 states have (on average 1.3121387283236994) internal successors, (227), 178 states have internal predecessors, (227), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 11:34:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 311 transitions. [2024-10-11 11:34:02,304 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 311 transitions. Word has length 94 [2024-10-11 11:34:02,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:34:02,305 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 311 transitions. [2024-10-11 11:34:02,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:34:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 311 transitions. [2024-10-11 11:34:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 11:34:02,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:34:02,307 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:02,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:34:02,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:34:02,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:34:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash 108121276, now seen corresponding path program 1 times [2024-10-11 11:34:02,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:34:02,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229335180] [2024-10-11 11:34:02,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:34:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:34:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:34:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:34:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:34:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:34:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:34:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:34:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:34:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:34:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:34:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:34:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:34:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 11:34:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:34:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:34:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:34:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 11:34:10,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:34:10,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229335180] [2024-10-11 11:34:10,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229335180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:34:10,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:34:10,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:34:10,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280558046] [2024-10-11 11:34:10,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:34:10,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:34:10,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:34:10,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:34:10,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:34:10,382 INFO L87 Difference]: Start difference. First operand 223 states and 311 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:34:11,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:34:11,008 INFO L93 Difference]: Finished difference Result 378 states and 523 transitions. [2024-10-11 11:34:11,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:34:11,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-11 11:34:11,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:34:11,011 INFO L225 Difference]: With dead ends: 378 [2024-10-11 11:34:11,011 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 11:34:11,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:34:11,012 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 45 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:34:11,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 313 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:34:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 11:34:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 223. [2024-10-11 11:34:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 173 states have (on average 1.30635838150289) internal successors, (226), 178 states have internal predecessors, (226), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 37 states have call predecessors, (42), 42 states have call successors, (42) [2024-10-11 11:34:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 310 transitions. [2024-10-11 11:34:11,052 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 310 transitions. Word has length 94 [2024-10-11 11:34:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:34:11,052 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 310 transitions. [2024-10-11 11:34:11,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 11:34:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 310 transitions. [2024-10-11 11:34:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 11:34:11,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:34:11,053 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:11,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 11:34:11,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:34:11,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:34:11,054 INFO L85 PathProgramCache]: Analyzing trace with hash -519378020, now seen corresponding path program 1 times [2024-10-11 11:34:11,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:34:11,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204134844] [2024-10-11 11:34:11,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:34:11,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:34:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:34:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [549318567] [2024-10-11 11:34:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:34:11,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:34:11,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:34:11,092 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:34:11,094 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:34:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:34:11,201 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:34:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:34:11,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:34:11,330 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:34:11,331 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:34:11,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:34:11,533 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,SelfDestructingSolverStorable9 [2024-10-11 11:34:11,536 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:34:11,622 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:34:11,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:34:11 BoogieIcfgContainer [2024-10-11 11:34:11,626 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:34:11,626 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:34:11,626 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:34:11,627 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:34:11,627 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:32:48" (3/4) ... [2024-10-11 11:34:11,633 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:34:11,637 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:34:11,638 INFO L158 Benchmark]: Toolchain (without parser) took 84196.58ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 99.3MB in the beginning and 825.0MB in the end (delta: -725.7MB). Peak memory consumption was 324.8MB. Max. memory is 16.1GB. [2024-10-11 11:34:11,638 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 79.1MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:34:11,638 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.50ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 85.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:34:11,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.09ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 141.0MB in the end (delta: -55.6MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-10-11 11:34:11,642 INFO L158 Benchmark]: Boogie Preprocessor took 71.64ms. Allocated memory is still 167.8MB. Free memory was 141.0MB in the beginning and 138.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:34:11,642 INFO L158 Benchmark]: RCFGBuilder took 505.35ms. Allocated memory is still 167.8MB. Free memory was 138.6MB in the beginning and 119.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 11:34:11,643 INFO L158 Benchmark]: TraceAbstraction took 83251.28ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 119.1MB in the beginning and 825.0MB in the end (delta: -705.9MB). Peak memory consumption was 345.7MB. Max. memory is 16.1GB. [2024-10-11 11:34:11,643 INFO L158 Benchmark]: Witness Printer took 10.73ms. Allocated memory is still 1.2GB. Free memory is still 825.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:34:11,644 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 79.1MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.50ms. Allocated memory is still 167.8MB. Free memory was 99.2MB in the beginning and 85.4MB in the end (delta: 13.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.09ms. Allocated memory is still 167.8MB. Free memory was 85.4MB in the beginning and 141.0MB in the end (delta: -55.6MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.64ms. Allocated memory is still 167.8MB. Free memory was 141.0MB in the beginning and 138.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 505.35ms. Allocated memory is still 167.8MB. Free memory was 138.6MB in the beginning and 119.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 83251.28ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 119.1MB in the beginning and 825.0MB in the end (delta: -705.9MB). Peak memory consumption was 345.7MB. Max. memory is 16.1GB. * Witness Printer took 10.73ms. Allocated memory is still 1.2GB. Free memory is still 825.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned long int var_1_3 = 3164414017; [L25] unsigned long int var_1_4 = 128; [L26] signed char var_1_5 = -128; [L27] signed char var_1_6 = 10; [L28] signed char var_1_7 = 50; [L29] float var_1_8 = 5.1; [L30] float var_1_9 = 63.75; [L31] signed char var_1_10 = 100; [L32] signed long int var_1_12 = 5; [L33] signed char last_1_var_1_10 = 100; [L97] isInitial = 1 [L98] FCALL initially() [L99] int k_loop; [L100] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=0, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L100] COND TRUE k_loop < 1 [L101] CALL updateLastVariables() [L90] last_1_var_1_10 = var_1_10 [L101] RET updateLastVariables() [L102] CALL updateVariables() [L67] var_1_2 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L68] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L69] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=3164414017, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L70] var_1_3 = __VERIFIER_nondet_ulong() [L71] CALL assume_abort_if_not(var_1_3 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L71] RET assume_abort_if_not(var_1_3 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] CALL assume_abort_if_not(var_1_3 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L72] RET assume_abort_if_not(var_1_3 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=128, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L73] var_1_4 = __VERIFIER_nondet_ulong() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L75] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=10, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L76] var_1_6 = __VERIFIER_nondet_char() [L77] CALL assume_abort_if_not(var_1_6 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L77] RET assume_abort_if_not(var_1_6 >= -126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L78] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=50, var_1_8=51/10, var_1_9=255/4] [L79] var_1_7 = __VERIFIER_nondet_char() [L80] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L80] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L81] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10, var_1_9=255/4] [L82] var_1_9 = __VERIFIER_nondet_float() [L83] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L83] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=5, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L84] var_1_12 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_12 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L85] RET assume_abort_if_not(var_1_12 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L86] CALL assume_abort_if_not(var_1_12 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L86] RET assume_abort_if_not(var_1_12 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L87] CALL assume_abort_if_not(var_1_12 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L87] RET assume_abort_if_not(var_1_12 != 0) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=1, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L102] RET updateVariables() [L103] CALL step() [L37] COND TRUE \read(var_1_2) [L38] var_1_1 = ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L40] signed long int stepLocal_1 = -8; [L41] unsigned long int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_1=-8, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-128, var_1_6=126, var_1_7=0, var_1_8=51/10] [L42] COND FALSE !(stepLocal_1 < var_1_4) [L49] var_1_5 = -2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L51] unsigned long int stepLocal_3 = var_1_1; VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L52] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L52] unsigned long int stepLocal_2 = var_1_4 >> var_1_3; [L53] COND TRUE var_1_6 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, stepLocal_3=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=51/10] [L54] COND TRUE var_1_6 != stepLocal_3 [L55] var_1_8 = var_1_9 VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L58] COND FALSE !((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) VAL [isInitial=1, last_1_var_1_10=100, stepLocal_0=-2147483649, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L103] RET step() [L104] CALL, EXPR property() [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR var_1_4 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93] EXPR ((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L93-L94] return (((var_1_2 ? (var_1_1 == ((unsigned long int) ((((var_1_3 - var_1_4) < 0 ) ? -(var_1_3 - var_1_4) : (var_1_3 - var_1_4))))) : 1) && ((-8 < var_1_4) ? ((var_1_4 != var_1_1) ? (var_1_5 == ((signed char) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) - var_1_7))) : (var_1_5 == ((signed char) var_1_6))) : (var_1_5 == ((signed char) -2)))) && ((var_1_6 >= (var_1_4 >> var_1_3)) ? ((var_1_6 != var_1_1) ? (var_1_8 == ((float) var_1_9)) : 1) : 1)) && (((var_1_1 + (var_1_6 / var_1_12)) < var_1_1) ? ((var_1_7 >= last_1_var_1_10) ? (var_1_10 == ((signed char) -32)) : (var_1_10 == ((signed char) var_1_7))) : 1) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=100, var_1_10=100, var_1_12=125, var_1_1=-2147483649, var_1_2=1, var_1_3=6442450943, var_1_4=8589934592, var_1_5=-2, var_1_6=126, var_1_7=0, var_1_8=2, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 83.1s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 507 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 507 mSDsluCounter, 2368 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1749 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1663 IncrementalHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 619 mSDtfsCounter, 1663 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 299 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=7, InterpolantAutomatonStates: 58, 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, 9 MinimizatonAttempts, 189 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 76.0s InterpolantComputationTime, 1028 NumberOfCodeBlocks, 1028 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 14118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 3276/3276 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:34:11,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_25-1loop_file-87.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 1d6740d93249b8004eae6c6ec99a57fdd342d0b18a807811334b011905a57c0b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:34:13,873 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:34:13,946 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:34:13,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:34:13,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:34:13,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:34:13,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:34:13,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:34:13,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:34:13,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:34:13,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:34:13,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:34:13,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:34:13,998 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:34:13,999 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:34:13,999 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:34:13,999 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:34:14,000 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:34:14,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:34:14,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:34:14,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:34:14,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:34:14,004 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:34:14,007 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:34:14,007 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:34:14,007 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:34:14,008 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:34:14,008 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:34:14,008 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:34:14,008 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:34:14,009 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:34:14,009 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:34:14,009 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:34:14,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:34:14,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:34:14,010 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:34:14,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:34:14,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:34:14,011 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:34:14,011 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:34:14,011 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:34:14,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:34:14,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:34:14,013 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:34:14,013 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:34:14,013 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC