./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/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-wip.fs.cvc5-61a6796-m [2024-10-14 13:05:25,505 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 13:05:25,565 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 13:05:25,569 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 13:05:25,570 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 13:05:25,589 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 13:05:25,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 13:05:25,590 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 13:05:25,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 13:05:25,591 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 13:05:25,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 13:05:25,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 13:05:25,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 13:05:25,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 13:05:25,593 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 13:05:25,593 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 13:05:25,594 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 13:05:25,594 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 13:05:25,594 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 13:05:25,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 13:05:25,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 13:05:25,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 13:05:25,599 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 13:05:25,599 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 13:05:25,599 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 13:05:25,600 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 13:05:25,600 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 13:05:25,600 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 13:05:25,601 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 13:05:25,601 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 13:05:25,601 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 13:05:25,601 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 13:05:25,601 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:05:25,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 13:05:25,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 13:05:25,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 13:05:25,603 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 13:05:25,604 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 13:05:25,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 13:05:25,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 13:05:25,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 13:05:25,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 13:05:25,605 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-10-14 13:05:25,853 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 13:05:25,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 13:05:25,882 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 13:05:25,883 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 13:05:25,884 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 13:05:25,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2024-10-14 13:05:27,238 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 13:05:27,447 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 13:05:27,448 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i [2024-10-14 13:05:27,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350f61346/4e456b9eeea14199aa51e2c534c444be/FLAG8e4c9c6e5 [2024-10-14 13:05:27,471 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/350f61346/4e456b9eeea14199aa51e2c534c444be [2024-10-14 13:05:27,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 13:05:27,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 13:05:27,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 13:05:27,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 13:05:27,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 13:05:27,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e9c38f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27, skipping insertion in model container [2024-10-14 13:05:27,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 13:05:27,657 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i[915,928] [2024-10-14 13:05:27,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:05:27,747 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 13:05:27,759 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-66.i[915,928] [2024-10-14 13:05:27,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 13:05:27,820 INFO L204 MainTranslator]: Completed translation [2024-10-14 13:05:27,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27 WrapperNode [2024-10-14 13:05:27,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 13:05:27,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 13:05:27,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 13:05:27,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 13:05:27,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,845 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,892 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 132 [2024-10-14 13:05:27,892 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 13:05:27,893 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 13:05:27,893 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 13:05:27,893 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 13:05:27,908 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,913 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,928 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 13:05:27,929 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,929 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,940 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,942 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,943 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,946 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 13:05:27,947 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 13:05:27,948 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 13:05:27,948 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 13:05:27,949 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (1/1) ... [2024-10-14 13:05:27,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 13:05:27,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 13:05:27,994 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-10-14 13:05:27,997 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-10-14 13:05:28,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 13:05:28,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 13:05:28,049 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 13:05:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 13:05:28,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 13:05:28,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 13:05:28,134 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 13:05:28,136 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 13:05:28,446 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 13:05:28,448 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 13:05:28,485 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 13:05:28,485 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 13:05:28,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:05:28 BoogieIcfgContainer [2024-10-14 13:05:28,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 13:05:28,488 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 13:05:28,488 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 13:05:28,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 13:05:28,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 01:05:27" (1/3) ... [2024-10-14 13:05:28,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2325b89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:05:28, skipping insertion in model container [2024-10-14 13:05:28,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 01:05:27" (2/3) ... [2024-10-14 13:05:28,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2325b89a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 01:05:28, skipping insertion in model container [2024-10-14 13:05:28,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 01:05:28" (3/3) ... [2024-10-14 13:05:28,496 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-66.i [2024-10-14 13:05:28,512 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 13:05:28,512 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 13:05:28,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 13:05:28,576 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;@2afee73a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 13:05:28,576 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 13:05:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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-10-14 13:05:28,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:05:28,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:05:28,596 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] [2024-10-14 13:05:28,597 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:05:28,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:05:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1567801026, now seen corresponding path program 1 times [2024-10-14 13:05:28,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:05:28,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942552477] [2024-10-14 13:05:28,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:05:28,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:05:29,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:05:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 13:05:54,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 13:05:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 13:05:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 13:05:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:05:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:05:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 13:05:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 13:05:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 13:05:54,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 13:05:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:05:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:05:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 13:05:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 13:05:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 13:05:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 13:05:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:05:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:05:54,616 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 13:05:54,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:05:54,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942552477] [2024-10-14 13:05:54,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942552477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:05:54,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:05:54,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 13:05:54,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021674603] [2024-10-14 13:05:54,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:05:54,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 13:05:54,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:05:54,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 13:05:54,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:05:54,656 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.5) internal successors, (51), 35 states have internal predecessors, (51), 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 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-10-14 13:05:55,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:05:55,781 INFO L93 Difference]: Finished difference Result 206 states and 358 transitions. [2024-10-14 13:05:55,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 13:05:55,784 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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 115 [2024-10-14 13:05:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:05:55,797 INFO L225 Difference]: With dead ends: 206 [2024-10-14 13:05:55,798 INFO L226 Difference]: Without dead ends: 152 [2024-10-14 13:05:55,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:05:55,805 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 146 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 13:05:55,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 395 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 13:05:55,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-14 13:05:55,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 96. [2024-10-14 13:05:55,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 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-10-14 13:05:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-10-14 13:05:55,855 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 115 [2024-10-14 13:05:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:05:55,856 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-10-14 13:05:55,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-10-14 13:05:55,856 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-10-14 13:05:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:05:55,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:05:55,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] [2024-10-14 13:05:55,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 13:05:55,860 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:05:55,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:05:55,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1567860608, now seen corresponding path program 1 times [2024-10-14 13:05:55,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:05:55,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934913819] [2024-10-14 13:05:55,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:05:55,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:05:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:06:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 13:06:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 13:06:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 13:06:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 13:06:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:06:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:06:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 13:06:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 13:06:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 13:06:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 13:06:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:06:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:06:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 13:06:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 13:06:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 13:06:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 13:06:21,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:06:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 13:06:21,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:06:21,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934913819] [2024-10-14 13:06:21,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934913819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:06:21,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:06:21,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 13:06:21,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538620947] [2024-10-14 13:06:21,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:06:21,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 13:06:21,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:06:21,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 13:06:21,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:06:21,285 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 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-10-14 13:06:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:06:22,676 INFO L93 Difference]: Finished difference Result 150 states and 213 transitions. [2024-10-14 13:06:22,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 13:06:22,677 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 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 115 [2024-10-14 13:06:22,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:06:22,679 INFO L225 Difference]: With dead ends: 150 [2024-10-14 13:06:22,679 INFO L226 Difference]: Without dead ends: 148 [2024-10-14 13:06:22,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-10-14 13:06:22,681 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 153 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 13:06:22,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 387 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 13:06:22,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-14 13:06:22,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 96. [2024-10-14 13:06:22,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 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-10-14 13:06:22,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 146 transitions. [2024-10-14 13:06:22,702 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 146 transitions. Word has length 115 [2024-10-14 13:06:22,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:06:22,703 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 146 transitions. [2024-10-14 13:06:22,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 15 states have internal predecessors, (28), 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-10-14 13:06:22,703 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 146 transitions. [2024-10-14 13:06:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:06:22,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:06:22,705 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] [2024-10-14 13:06:22,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 13:06:22,705 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:06:22,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:06:22,706 INFO L85 PathProgramCache]: Analyzing trace with hash 758454400, now seen corresponding path program 1 times [2024-10-14 13:06:22,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:06:22,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987451901] [2024-10-14 13:06:22,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:06:22,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:06:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 13:06:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 13:06:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 13:06:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 13:06:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 13:06:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 13:06:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 13:06:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 13:06:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 13:06:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 13:06:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 13:06:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 13:06:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 13:06:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 13:06:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 13:06:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 13:06:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 13:06:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 13:06:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 13:06:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-10-14 13:06:42,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 13:06:42,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987451901] [2024-10-14 13:06:42,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987451901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 13:06:42,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 13:06:42,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 13:06:42,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244641103] [2024-10-14 13:06:42,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 13:06:42,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 13:06:42,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 13:06:42,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 13:06:42,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-14 13:06:42,298 INFO L87 Difference]: Start difference. First operand 96 states and 146 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-10-14 13:06:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 13:06:43,701 INFO L93 Difference]: Finished difference Result 152 states and 215 transitions. [2024-10-14 13:06:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 13:06:43,701 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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 115 [2024-10-14 13:06:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 13:06:43,703 INFO L225 Difference]: With dead ends: 152 [2024-10-14 13:06:43,703 INFO L226 Difference]: Without dead ends: 150 [2024-10-14 13:06:43,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-14 13:06:43,705 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 163 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 13:06:43,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 404 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 13:06:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-14 13:06:43,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 101. [2024-10-14 13:06:43,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 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-10-14 13:06:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2024-10-14 13:06:43,720 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 153 transitions. Word has length 115 [2024-10-14 13:06:43,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 13:06:43,721 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 153 transitions. [2024-10-14 13:06:43,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 14 states have internal predecessors, (28), 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-10-14 13:06:43,722 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 153 transitions. [2024-10-14 13:06:43,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 13:06:43,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 13:06:43,723 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] [2024-10-14 13:06:43,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 13:06:43,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 13:06:43,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 13:06:43,724 INFO L85 PathProgramCache]: Analyzing trace with hash 758513982, now seen corresponding path program 1 times [2024-10-14 13:06:43,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 13:06:43,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858939540] [2024-10-14 13:06:43,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 13:06:43,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 13:06:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat