./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:55:56,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:55:56,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 08:55:56,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:55:56,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:55:56,453 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:55:56,454 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:55:56,454 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:55:56,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:55:56,455 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:55:56,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:55:56,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:55:56,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:55:56,458 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:55:56,458 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:55:56,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:55:56,460 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:55:56,460 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:55:56,462 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 08:55:56,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:55:56,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:55:56,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:55:56,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:55:56,465 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:55:56,465 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:55:56,465 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:55:56,465 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:55:56,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:55:56,466 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:55:56,466 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:55:56,467 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:55:56,467 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:55:56,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:55:56,467 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:55:56,468 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:55:56,468 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:55:56,468 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 08:55:56,468 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 08:55:56,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:55:56,469 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:55:56,469 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:55:56,469 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:55:56,469 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 [2024-11-10 08:55:56,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:55:56,757 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:55:56,761 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:55:56,762 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:55:56,762 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:55:56,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2024-11-10 08:55:58,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:55:58,366 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:55:58,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2024-11-10 08:55:58,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81055d229/cf7502335e57414da67ff764da1628e8/FLAG51764db27 [2024-11-10 08:55:58,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81055d229/cf7502335e57414da67ff764da1628e8 [2024-11-10 08:55:58,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:55:58,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:55:58,396 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:55:58,396 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:55:58,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:55:58,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73dbf62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58, skipping insertion in model container [2024-11-10 08:55:58,405 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,432 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:55:58,583 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i[915,928] [2024-11-10 08:55:58,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:55:58,647 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:55:58,657 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i[915,928] [2024-11-10 08:55:58,680 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:55:58,697 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:55:58,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58 WrapperNode [2024-11-10 08:55:58,698 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:55:58,699 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:55:58,699 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:55:58,699 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:55:58,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,748 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2024-11-10 08:55:58,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:55:58,749 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:55:58,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:55:58,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:55:58,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,765 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,791 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:55:58,792 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,792 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,799 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,801 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,802 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:55:58,806 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:55:58,806 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:55:58,806 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:55:58,811 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (1/1) ... [2024-11-10 08:55:58,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:55:58,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:55:58,847 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:55:58,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:55:58,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:55:58,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:55:58,901 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:55:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 08:55:58,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:55:58,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:55:58,977 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:55:58,978 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:55:59,267 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 08:55:59,267 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:55:59,280 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:55:59,280 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:55:59,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:59 BoogieIcfgContainer [2024-11-10 08:55:59,281 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:55:59,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:55:59,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:55:59,286 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:55:59,286 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:55:58" (1/3) ... [2024-11-10 08:55:59,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a643810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:55:59, skipping insertion in model container [2024-11-10 08:55:59,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:55:58" (2/3) ... [2024-11-10 08:55:59,287 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a643810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:55:59, skipping insertion in model container [2024-11-10 08:55:59,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:59" (3/3) ... [2024-11-10 08:55:59,288 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-66.i [2024-11-10 08:55:59,301 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:55:59,302 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:55:59,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:55:59,395 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;@379c606f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:55:59,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:55:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 08:55:59,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:55:59,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:55:59,436 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:55:59,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:55:59,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:55:59,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1142491791, now seen corresponding path program 1 times [2024-11-10 08:55:59,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:55:59,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889997817] [2024-11-10 08:55:59,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:55:59,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:55:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:56:04,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:56:04,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:56:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:56:04,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:56:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:56:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:56:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:56:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:56:04,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:56:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:56:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:56:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:56:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:56:04,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:56:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:56:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 08:56:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:56:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:56:04,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:56:04,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889997817] [2024-11-10 08:56:04,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889997817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:04,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:04,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 08:56:04,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555868134] [2024-11-10 08:56:04,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:04,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 08:56:04,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:56:04,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 08:56:04,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-10 08:56:04,215 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:05,134 INFO L93 Difference]: Finished difference Result 254 states and 410 transitions. [2024-11-10 08:56:05,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 08:56:05,137 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 08:56:05,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:05,148 INFO L225 Difference]: With dead ends: 254 [2024-11-10 08:56:05,148 INFO L226 Difference]: Without dead ends: 193 [2024-11-10 08:56:05,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-10 08:56:05,160 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 197 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:05,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 553 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 08:56:05,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-10 08:56:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 105. [2024-11-10 08:56:05,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 08:56:05,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-10 08:56:05,244 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 121 [2024-11-10 08:56:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:05,246 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-10 08:56:05,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:05,247 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-10 08:56:05,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:56:05,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:05,250 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:05,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 08:56:05,251 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:05,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1171120942, now seen corresponding path program 1 times [2024-11-10 08:56:05,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:56:05,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772899276] [2024-11-10 08:56:05,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:05,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:56:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:56:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:56:10,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:56:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:56:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:56:10,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:56:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:56:10,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:56:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:56:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:56:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:56:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:56:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:56:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:56:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:56:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:56:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 08:56:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:56:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:10,078 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:56:10,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:56:10,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772899276] [2024-11-10 08:56:10,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772899276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:10,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:10,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 08:56:10,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873705119] [2024-11-10 08:56:10,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:10,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 08:56:10,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:56:10,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 08:56:10,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-10 08:56:10,085 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:12,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:12,276 INFO L93 Difference]: Finished difference Result 193 states and 257 transitions. [2024-11-10 08:56:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 08:56:12,277 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 08:56:12,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:12,279 INFO L225 Difference]: With dead ends: 193 [2024-11-10 08:56:12,279 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 08:56:12,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-10 08:56:12,283 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 203 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:12,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 573 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 08:56:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 08:56:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 105. [2024-11-10 08:56:12,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 08:56:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-10 08:56:12,312 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 121 [2024-11-10 08:56:12,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:12,313 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-10 08:56:12,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-10 08:56:12,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:56:12,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:12,316 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:12,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 08:56:12,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:12,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:12,317 INFO L85 PathProgramCache]: Analyzing trace with hash 945978286, now seen corresponding path program 1 times [2024-11-10 08:56:12,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:56:12,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196408032] [2024-11-10 08:56:12,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:12,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:56:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:56:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:56:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:56:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:56:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:56:16,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:56:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:56:16,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:56:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:56:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:56:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:56:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:56:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:56:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:56:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:56:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:56:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 08:56:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:56:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:56:16,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:56:16,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196408032] [2024-11-10 08:56:16,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196408032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:16,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:16,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 08:56:16,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932374955] [2024-11-10 08:56:16,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:16,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 08:56:16,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:56:16,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 08:56:16,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-10 08:56:16,129 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:17,055 INFO L93 Difference]: Finished difference Result 201 states and 266 transitions. [2024-11-10 08:56:17,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 08:56:17,056 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 08:56:17,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:17,058 INFO L225 Difference]: With dead ends: 201 [2024-11-10 08:56:17,058 INFO L226 Difference]: Without dead ends: 198 [2024-11-10 08:56:17,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-10 08:56:17,060 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 210 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:17,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 542 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 08:56:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-10 08:56:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 109. [2024-11-10 08:56:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 85 states have internal predecessors, (117), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 08:56:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-10 08:56:17,083 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 121 [2024-11-10 08:56:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:17,083 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-10 08:56:17,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-10 08:56:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:56:17,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:17,089 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:17,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 08:56:17,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:17,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:17,093 INFO L85 PathProgramCache]: Analyzing trace with hash 974607437, now seen corresponding path program 1 times [2024-11-10 08:56:17,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:56:17,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242282188] [2024-11-10 08:56:17,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:17,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:56:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:56:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:56:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:56:21,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:56:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:56:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:56:21,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:56:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:56:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:56:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:56:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:56:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:56:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:56:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:56:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:56:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:56:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 08:56:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:56:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:21,474 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:56:21,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:56:21,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242282188] [2024-11-10 08:56:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242282188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:21,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:21,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-10 08:56:21,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129514326] [2024-11-10 08:56:21,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:21,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 08:56:21,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:56:21,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 08:56:21,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2024-11-10 08:56:21,477 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:22,681 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2024-11-10 08:56:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 08:56:22,682 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 08:56:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:22,683 INFO L225 Difference]: With dead ends: 198 [2024-11-10 08:56:22,683 INFO L226 Difference]: Without dead ends: 195 [2024-11-10 08:56:22,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2024-11-10 08:56:22,685 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 208 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:22,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 616 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 08:56:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-10 08:56:22,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 105. [2024-11-10 08:56:22,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 08:56:22,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-10 08:56:22,699 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 121 [2024-11-10 08:56:22,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:22,700 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-10 08:56:22,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:22,700 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-10 08:56:22,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:56:22,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:22,702 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:22,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 08:56:22,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:22,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:22,703 INFO L85 PathProgramCache]: Analyzing trace with hash 849088784, now seen corresponding path program 1 times [2024-11-10 08:56:22,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:56:22,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008742185] [2024-11-10 08:56:22,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:56:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:56:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:56:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:56:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:56:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:56:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:56:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:56:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:56:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:56:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:56:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:56:22,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:56:22,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:56:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:56:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:56:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:56:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 08:56:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:56:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:56:22,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:56:22,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008742185] [2024-11-10 08:56:22,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008742185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:22,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:22,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 08:56:22,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451530099] [2024-11-10 08:56:22,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:22,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 08:56:22,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:56:22,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 08:56:22,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:56:22,775 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:22,821 INFO L93 Difference]: Finished difference Result 290 states and 431 transitions. [2024-11-10 08:56:22,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 08:56:22,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 08:56:22,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:22,826 INFO L225 Difference]: With dead ends: 290 [2024-11-10 08:56:22,826 INFO L226 Difference]: Without dead ends: 188 [2024-11-10 08:56:22,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 08:56:22,829 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 75 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:22,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 227 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 08:56:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-11-10 08:56:22,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 185. [2024-11-10 08:56:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 136 states have (on average 1.3161764705882353) internal successors, (179), 138 states have internal predecessors, (179), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-10 08:56:22,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 267 transitions. [2024-11-10 08:56:22,855 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 267 transitions. Word has length 121 [2024-11-10 08:56:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:22,856 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 267 transitions. [2024-11-10 08:56:22,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 267 transitions. [2024-11-10 08:56:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:56:22,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:22,859 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:22,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 08:56:22,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:22,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash -958365679, now seen corresponding path program 1 times [2024-11-10 08:56:22,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:56:22,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355160196] [2024-11-10 08:56:22,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:22,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:56:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:56:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:56:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:56:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:56:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:56:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:56:22,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:56:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:56:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:56:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:56:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:56:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:56:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:56:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:56:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:56:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:56:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 08:56:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:22,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:56:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:23,012 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:56:23,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:56:23,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355160196] [2024-11-10 08:56:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355160196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:23,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:23,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:56:23,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243926349] [2024-11-10 08:56:23,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:23,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:56:23,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:56:23,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:56:23,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:56:23,017 INFO L87 Difference]: Start difference. First operand 185 states and 267 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:23,204 INFO L93 Difference]: Finished difference Result 547 states and 778 transitions. [2024-11-10 08:56:23,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:56:23,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 08:56:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:23,207 INFO L225 Difference]: With dead ends: 547 [2024-11-10 08:56:23,208 INFO L226 Difference]: Without dead ends: 365 [2024-11-10 08:56:23,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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-11-10 08:56:23,209 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 74 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:23,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 274 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 08:56:23,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-10 08:56:23,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 316. [2024-11-10 08:56:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 223 states have (on average 1.2869955156950672) internal successors, (287), 226 states have internal predecessors, (287), 84 states have call successors, (84), 8 states have call predecessors, (84), 8 states have return successors, (84), 81 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-10 08:56:23,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 455 transitions. [2024-11-10 08:56:23,251 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 455 transitions. Word has length 121 [2024-11-10 08:56:23,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:23,252 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 455 transitions. [2024-11-10 08:56:23,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:23,252 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 455 transitions. [2024-11-10 08:56:23,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:56:23,253 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:23,253 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:23,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 08:56:23,254 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:23,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:23,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1154879184, now seen corresponding path program 1 times [2024-11-10 08:56:23,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:56:23,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299646339] [2024-11-10 08:56:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:23,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:56:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:24,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:56:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:24,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:56:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:24,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:56:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:56:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:56:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:56:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:56:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:56:25,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:56:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:56:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:56:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:56:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:56:25,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:56:25,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:56:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:56:25,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 08:56:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:56:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:25,042 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:56:25,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:56:25,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299646339] [2024-11-10 08:56:25,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299646339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:25,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:25,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 08:56:25,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269225250] [2024-11-10 08:56:25,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:25,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 08:56:25,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:56:25,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 08:56:25,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-10 08:56:25,045 INFO L87 Difference]: Start difference. First operand 316 states and 455 transitions. Second operand has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:25,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:25,739 INFO L93 Difference]: Finished difference Result 475 states and 635 transitions. [2024-11-10 08:56:25,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 08:56:25,740 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 08:56:25,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:25,743 INFO L225 Difference]: With dead ends: 475 [2024-11-10 08:56:25,743 INFO L226 Difference]: Without dead ends: 472 [2024-11-10 08:56:25,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:56:25,744 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 273 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:25,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 505 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 08:56:25,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-10 08:56:25,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 374. [2024-11-10 08:56:25,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 270 states have (on average 1.2666666666666666) internal successors, (342), 275 states have internal predecessors, (342), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-10 08:56:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 526 transitions. [2024-11-10 08:56:25,801 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 526 transitions. Word has length 121 [2024-11-10 08:56:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:25,801 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 526 transitions. [2024-11-10 08:56:25,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 12 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:25,802 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 526 transitions. [2024-11-10 08:56:25,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:56:25,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:25,804 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:25,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 08:56:25,804 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:25,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:25,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1126250033, now seen corresponding path program 1 times [2024-11-10 08:56:25,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:56:25,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866768527] [2024-11-10 08:56:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:25,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:56:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:56:28,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:56:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:56:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:56:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:56:28,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:56:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:56:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:56:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:56:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:56:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:56:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:56:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:56:28,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:56:28,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:56:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:56:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 08:56:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:56:28,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:56:28,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:56:28,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866768527] [2024-11-10 08:56:28,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866768527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:28,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:28,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 08:56:28,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037709495] [2024-11-10 08:56:28,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:28,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 08:56:28,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:56:28,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 08:56:28,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2024-11-10 08:56:28,414 INFO L87 Difference]: Start difference. First operand 374 states and 526 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:29,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:29,878 INFO L93 Difference]: Finished difference Result 472 states and 632 transitions. [2024-11-10 08:56:29,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 08:56:29,879 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2024-11-10 08:56:29,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:29,882 INFO L225 Difference]: With dead ends: 472 [2024-11-10 08:56:29,882 INFO L226 Difference]: Without dead ends: 469 [2024-11-10 08:56:29,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2024-11-10 08:56:29,883 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 226 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:29,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 690 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 08:56:29,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-10 08:56:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 374. [2024-11-10 08:56:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 270 states have (on average 1.2666666666666666) internal successors, (342), 275 states have internal predecessors, (342), 92 states have call successors, (92), 11 states have call predecessors, (92), 11 states have return successors, (92), 87 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-10 08:56:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 526 transitions. [2024-11-10 08:56:29,940 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 526 transitions. Word has length 121 [2024-11-10 08:56:29,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:29,941 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 526 transitions. [2024-11-10 08:56:29,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-10 08:56:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 526 transitions. [2024-11-10 08:56:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:56:29,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:29,943 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:29,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 08:56:29,943 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:29,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:29,944 INFO L85 PathProgramCache]: Analyzing trace with hash 636933166, now seen corresponding path program 1 times [2024-11-10 08:56:29,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:56:29,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320922042] [2024-11-10 08:56:29,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:29,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:56:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 08:56:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 08:56:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 08:56:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 08:56:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 08:56:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 08:56:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 08:56:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 08:56:30,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 08:56:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 08:56:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 08:56:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 08:56:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 08:56:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 08:56:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 08:56:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 08:56:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 08:56:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 08:56:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-10 08:56:30,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:56:30,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320922042] [2024-11-10 08:56:30,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320922042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 08:56:30,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 08:56:30,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 08:56:30,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946893077] [2024-11-10 08:56:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 08:56:30,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 08:56:30,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:56:30,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 08:56:30,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 08:56:30,244 INFO L87 Difference]: Start difference. First operand 374 states and 526 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:56:30,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:30,490 INFO L93 Difference]: Finished difference Result 709 states and 985 transitions. [2024-11-10 08:56:30,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 08:56:30,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2024-11-10 08:56:30,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:30,493 INFO L225 Difference]: With dead ends: 709 [2024-11-10 08:56:30,493 INFO L226 Difference]: Without dead ends: 382 [2024-11-10 08:56:30,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 08:56:30,496 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 130 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:30,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 174 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 08:56:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-10 08:56:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 372. [2024-11-10 08:56:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 262 states have (on average 1.2251908396946565) internal successors, (321), 267 states have internal predecessors, (321), 96 states have call successors, (96), 13 states have call predecessors, (96), 13 states have return successors, (96), 91 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 08:56:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 513 transitions. [2024-11-10 08:56:30,537 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 513 transitions. Word has length 121 [2024-11-10 08:56:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:30,538 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 513 transitions. [2024-11-10 08:56:30,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-10 08:56:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 513 transitions. [2024-11-10 08:56:30,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 08:56:30,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:30,539 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:30,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 08:56:30,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:30,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:30,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1213374564, now seen corresponding path program 1 times [2024-11-10 08:56:30,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:56:30,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270870494] [2024-11-10 08:56:30,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:30,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:56:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 08:56:30,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624741704] [2024-11-10 08:56:30,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:30,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:56:30,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:56:30,586 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:56:30,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 08:56:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:30,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 08:56:30,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 08:56:33,622 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 415 proven. 105 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-10 08:56:33,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 08:56:44,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 08:56:44,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270870494] [2024-11-10 08:56:44,785 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 08:56:44,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624741704] [2024-11-10 08:56:44,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624741704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 08:56:44,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 08:56:44,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2024-11-10 08:56:44,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798307860] [2024-11-10 08:56:44,786 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 08:56:44,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 08:56:44,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 08:56:44,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 08:56:44,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=580, Unknown=2, NotChecked=0, Total=756 [2024-11-10 08:56:44,788 INFO L87 Difference]: Start difference. First operand 372 states and 513 transitions. Second operand has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2024-11-10 08:56:48,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 08:56:48,079 INFO L93 Difference]: Finished difference Result 900 states and 1141 transitions. [2024-11-10 08:56:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-11-10 08:56:48,081 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) Word has length 122 [2024-11-10 08:56:48,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 08:56:48,087 INFO L225 Difference]: With dead ends: 900 [2024-11-10 08:56:48,088 INFO L226 Difference]: Without dead ends: 715 [2024-11-10 08:56:48,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=597, Invalid=2053, Unknown=2, NotChecked=0, Total=2652 [2024-11-10 08:56:48,090 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 222 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 08:56:48,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 352 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 559 Invalid, 2 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 08:56:48,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-11-10 08:56:48,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 461. [2024-11-10 08:56:48,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 332 states have (on average 1.1897590361445782) internal successors, (395), 337 states have internal predecessors, (395), 94 states have call successors, (94), 34 states have call predecessors, (94), 34 states have return successors, (94), 89 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-10 08:56:48,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 583 transitions. [2024-11-10 08:56:48,165 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 583 transitions. Word has length 122 [2024-11-10 08:56:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 08:56:48,166 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 583 transitions. [2024-11-10 08:56:48,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 22 states have internal predecessors, (62), 7 states have call successors, (18), 7 states have call predecessors, (18), 10 states have return successors, (18), 5 states have call predecessors, (18), 7 states have call successors, (18) [2024-11-10 08:56:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 583 transitions. [2024-11-10 08:56:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 08:56:48,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:48,167 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:48,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 08:56:48,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 08:56:48,369 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:48,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:48,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1184745413, now seen corresponding path program 1 times [2024-11-10 08:56:48,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 08:56:48,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44943587] [2024-11-10 08:56:48,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:48,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 08:56:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 08:56:48,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [190857906] [2024-11-10 08:56:48,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:48,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 08:56:48,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:56:48,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 08:56:48,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 08:56:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:56:48,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 08:56:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 08:56:48,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 08:56:48,633 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 08:56:48,634 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 08:56:48,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 08:56:48,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 08:56:48,839 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:48,933 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 08:56:48,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 08:56:48 BoogieIcfgContainer [2024-11-10 08:56:48,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 08:56:48,937 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 08:56:48,937 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 08:56:48,937 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 08:56:48,938 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:55:59" (3/4) ... [2024-11-10 08:56:48,940 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 08:56:48,941 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 08:56:48,942 INFO L158 Benchmark]: Toolchain (without parser) took 50546.73ms. Allocated memory was 178.3MB in the beginning and 484.4MB in the end (delta: 306.2MB). Free memory was 141.6MB in the beginning and 186.9MB in the end (delta: -45.3MB). Peak memory consumption was 262.0MB. Max. memory is 16.1GB. [2024-11-10 08:56:48,942 INFO L158 Benchmark]: CDTParser took 1.47ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 08:56:48,942 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.07ms. Allocated memory is still 178.3MB. Free memory was 141.6MB in the beginning and 125.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 08:56:48,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.03ms. Allocated memory is still 178.3MB. Free memory was 125.9MB in the beginning and 122.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:56:48,942 INFO L158 Benchmark]: Boogie Preprocessor took 55.88ms. Allocated memory is still 178.3MB. Free memory was 122.7MB in the beginning and 118.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 08:56:48,943 INFO L158 Benchmark]: IcfgBuilder took 474.52ms. Allocated memory is still 178.3MB. Free memory was 118.5MB in the beginning and 98.6MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-10 08:56:48,943 INFO L158 Benchmark]: TraceAbstraction took 49653.37ms. Allocated memory was 178.3MB in the beginning and 484.4MB in the end (delta: 306.2MB). Free memory was 97.6MB in the beginning and 187.9MB in the end (delta: -90.4MB). Peak memory consumption was 215.8MB. Max. memory is 16.1GB. [2024-11-10 08:56:48,943 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 484.4MB. Free memory was 187.9MB in the beginning and 186.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 08:56:48,944 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.47ms. Allocated memory is still 117.4MB. Free memory is still 90.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.07ms. Allocated memory is still 178.3MB. Free memory was 141.6MB in the beginning and 125.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.03ms. Allocated memory is still 178.3MB. Free memory was 125.9MB in the beginning and 122.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.88ms. Allocated memory is still 178.3MB. Free memory was 122.7MB in the beginning and 118.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 474.52ms. Allocated memory is still 178.3MB. Free memory was 118.5MB in the beginning and 98.6MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 49653.37ms. Allocated memory was 178.3MB in the beginning and 484.4MB in the end (delta: 306.2MB). Free memory was 97.6MB in the beginning and 187.9MB in the end (delta: -90.4MB). Peak memory consumption was 215.8MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 484.4MB. Free memory was 187.9MB in the beginning and 186.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=8, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L127] RET updateLastVariables() [L128] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L89] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L90] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L91] var_1_4 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L92] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L93] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L94] var_1_6 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L95] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L96] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=2, var_1_8=256] [L97] var_1_7 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L98] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L99] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L99] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L100] var_1_10 = __VERIFIER_nondet_ushort() [L101] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L101] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L102] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L102] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L103] var_1_11 = __VERIFIER_nondet_ushort() [L104] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L104] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L105] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L105] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L106] var_1_14 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L107] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L108] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L108] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L109] var_1_20 = __VERIFIER_nondet_short() [L110] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L110] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L111] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L111] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=50, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L112] var_1_21 = __VERIFIER_nondet_short() [L113] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L113] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L114] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L114] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L128] RET updateVariables() [L129] CALL step() [L43] signed char stepLocal_1 = var_1_6; [L44] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=256] [L45] COND FALSE !(-25 == stepLocal_1) [L50] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=32767] [L52] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=127, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=32767] [L53] COND TRUE var_1_8 >= stepLocal_2 [L54] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=32767] [L56] COND TRUE \read(var_1_12) [L57] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=32767] [L59] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/2, var_1_6=1, var_1_7=127, var_1_8=32767] [L60] COND TRUE \read(var_1_12) [L61] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=32767] [L64] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=32767] [L65] COND TRUE var_1_1 < stepLocal_4 [L66] var_1_18 = (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=25, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=32767] [L70] COND TRUE \read(var_1_12) [L71] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=32767] [L73] COND TRUE -64 > (var_1_6 + var_1_19) [L74] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=32767] [L82] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=32767, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=32767] [L83] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=32767] [L129] RET step() [L130] CALL, EXPR property() [L120-L121] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=32767] [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-126, var_1_19=-16255, var_1_1=0, var_1_20=16383, var_1_21=16383, var_1_3=-63, var_1_4=63, var_1_5=33/4, var_1_6=1, var_1_7=127, var_1_8=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.5s, OverallIterations: 11, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 1830 SdHoareTripleChecker+Valid, 5.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1818 mSDsluCounter, 4506 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3528 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3699 IncrementalHoareTripleChecker+Invalid, 3850 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 978 mSDtfsCounter, 3699 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 648 GetRequests, 499 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 774 ImplicationChecksByTransitivity, 19.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=10, InterpolantAutomatonStates: 145, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 861 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 35.8s InterpolantComputationTime, 1577 NumberOfCodeBlocks, 1577 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1201 ConstructedInterpolants, 1 QuantifiedInterpolants, 12760 SizeOfPredicates, 11 NumberOfNonLiveVariables, 291 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 6015/6120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 08:56:49,160 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-10 08:56:49,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 08:56:51,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 08:56:51,205 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 08:56:51,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 08:56:51,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 08:56:51,238 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 08:56:51,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 08:56:51,239 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 08:56:51,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 08:56:51,241 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 08:56:51,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 08:56:51,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 08:56:51,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 08:56:51,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 08:56:51,246 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 08:56:51,246 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 08:56:51,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 08:56:51,247 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 08:56:51,247 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 08:56:51,247 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 08:56:51,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 08:56:51,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 08:56:51,248 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 08:56:51,248 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 08:56:51,248 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 08:56:51,249 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 08:56:51,249 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 08:56:51,249 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 08:56:51,249 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 08:56:51,249 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 08:56:51,250 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 08:56:51,250 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 08:56:51,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 08:56:51,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 08:56:51,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:56:51,251 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 08:56:51,251 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 08:56:51,251 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 08:56:51,251 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 08:56:51,252 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 08:56:51,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 08:56:51,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 08:56:51,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 08:56:51,253 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 08:56:51,253 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 46dcd3bee3e07f84df18611ceb0a68103be2f6eabf5254259333ed4c471ba4e1 [2024-11-10 08:56:51,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 08:56:51,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 08:56:51,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 08:56:51,600 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 08:56:51,600 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 08:56:51,602 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2024-11-10 08:56:53,225 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 08:56:53,453 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 08:56:53,453 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2024-11-10 08:56:53,469 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1c52e5a/ca65fbbd67f94359ba183427ad556c7e/FLAG10ea31e84 [2024-11-10 08:56:53,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b1c52e5a/ca65fbbd67f94359ba183427ad556c7e [2024-11-10 08:56:53,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 08:56:53,807 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 08:56:53,808 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 08:56:53,808 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 08:56:53,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 08:56:53,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:56:53" (1/1) ... [2024-11-10 08:56:53,813 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7981d2ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:53, skipping insertion in model container [2024-11-10 08:56:53,813 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:56:53" (1/1) ... [2024-11-10 08:56:53,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 08:56:54,032 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i[915,928] [2024-11-10 08:56:54,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:56:54,122 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 08:56:54,149 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i[915,928] [2024-11-10 08:56:54,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 08:56:54,210 INFO L204 MainTranslator]: Completed translation [2024-11-10 08:56:54,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54 WrapperNode [2024-11-10 08:56:54,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 08:56:54,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 08:56:54,212 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 08:56:54,212 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 08:56:54,219 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,236 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,272 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-10 08:56:54,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 08:56:54,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 08:56:54,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 08:56:54,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 08:56:54,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,308 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 08:56:54,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,313 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 08:56:54,343 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 08:56:54,343 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 08:56:54,343 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 08:56:54,344 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (1/1) ... [2024-11-10 08:56:54,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 08:56:54,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 08:56:54,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 08:56:54,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 08:56:54,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 08:56:54,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 08:56:54,416 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 08:56:54,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 08:56:54,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 08:56:54,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 08:56:54,495 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 08:56:54,498 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 08:56:54,903 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 08:56:54,903 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 08:56:54,922 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 08:56:54,924 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 08:56:54,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:56:54 BoogieIcfgContainer [2024-11-10 08:56:54,924 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 08:56:54,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 08:56:54,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 08:56:54,946 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 08:56:54,946 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 08:56:53" (1/3) ... [2024-11-10 08:56:54,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5101be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:56:54, skipping insertion in model container [2024-11-10 08:56:54,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:56:54" (2/3) ... [2024-11-10 08:56:54,949 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5101be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 08:56:54, skipping insertion in model container [2024-11-10 08:56:54,949 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 08:56:54" (3/3) ... [2024-11-10 08:56:54,950 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-66.i [2024-11-10 08:56:54,968 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 08:56:54,969 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 08:56:55,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 08:56:55,046 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;@9f0eca1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 08:56:55,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 08:56:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 44 states have internal predecessors, (60), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 08:56:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 08:56:55,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 08:56:55,066 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 08:56:55,067 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 08:56:55,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 08:56:55,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1142491791, now seen corresponding path program 1 times [2024-11-10 08:56:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 08:56:55,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488864500] [2024-11-10 08:56:55,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 08:56:55,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 08:56:55,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 08:56:55,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 08:56:55,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 08:56:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 08:56:55,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 08:56:55,301 INFO L278 TraceCheckSpWp]: Computing forward predicates...