./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c --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/systemc/token_ring.06.cil-2.c -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 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 03:23:10,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 03:23:10,709 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 03:23:10,716 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 03:23:10,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 03:23:10,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 03:23:10,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 03:23:10,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 03:23:10,750 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 03:23:10,751 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 03:23:10,751 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 03:23:10,751 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 03:23:10,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 03:23:10,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 03:23:10,754 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 03:23:10,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 03:23:10,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 03:23:10,755 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 03:23:10,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 03:23:10,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 03:23:10,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 03:23:10,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 03:23:10,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 03:23:10,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 03:23:10,760 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 03:23:10,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 03:23:10,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 03:23:10,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 03:23:10,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 03:23:10,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 03:23:10,762 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 03:23:10,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 03:23:10,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:23:10,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 03:23:10,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 03:23:10,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 03:23:10,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 03:23:10,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 03:23:10,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 03:23:10,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 03:23:10,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 03:23:10,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 03:23:10,765 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 -> 4d0fbec14d1477738cb6d25ea9b61fc7005f787f2c8a0ac2c555d7e4fa1dbf47 [2024-10-14 03:23:11,011 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 03:23:11,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 03:23:11,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 03:23:11,040 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 03:23:11,040 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 03:23:11,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2024-10-14 03:23:12,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 03:23:12,713 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 03:23:12,714 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.06.cil-2.c [2024-10-14 03:23:12,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e35660d45/bb4dd96129c54483b1be0f88f945d355/FLAG7d2ee4f52 [2024-10-14 03:23:12,740 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e35660d45/bb4dd96129c54483b1be0f88f945d355 [2024-10-14 03:23:12,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 03:23:12,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 03:23:12,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 03:23:12,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 03:23:12,751 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 03:23:12,752 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:23:12" (1/1) ... [2024-10-14 03:23:12,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52a4c805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:12, skipping insertion in model container [2024-10-14 03:23:12,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 03:23:12" (1/1) ... [2024-10-14 03:23:12,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 03:23:12,941 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/systemc/token_ring.06.cil-2.c[671,684] [2024-10-14 03:23:13,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:23:13,036 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 03:23:13,048 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/systemc/token_ring.06.cil-2.c[671,684] [2024-10-14 03:23:13,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 03:23:13,157 INFO L204 MainTranslator]: Completed translation [2024-10-14 03:23:13,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13 WrapperNode [2024-10-14 03:23:13,161 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 03:23:13,162 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 03:23:13,162 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 03:23:13,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 03:23:13,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,235 INFO L138 Inliner]: procedures = 40, calls = 49, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 519 [2024-10-14 03:23:13,236 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 03:23:13,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 03:23:13,240 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 03:23:13,240 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 03:23:13,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,295 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 03:23:13,299 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,299 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 03:23:13,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 03:23:13,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 03:23:13,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 03:23:13,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (1/1) ... [2024-10-14 03:23:13,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 03:23:13,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:23:13,366 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 03:23:13,368 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 03:23:13,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 03:23:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 03:23:13,404 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 03:23:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 03:23:13,404 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 03:23:13,404 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 03:23:13,404 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 03:23:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 03:23:13,405 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 03:23:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 03:23:13,405 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 03:23:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 03:23:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 03:23:13,405 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 03:23:13,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 03:23:13,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 03:23:13,496 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 03:23:13,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 03:23:14,041 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-10-14 03:23:14,041 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 03:23:14,107 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 03:23:14,107 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-14 03:23:14,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:23:14 BoogieIcfgContainer [2024-10-14 03:23:14,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 03:23:14,110 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 03:23:14,110 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 03:23:14,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 03:23:14,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 03:23:12" (1/3) ... [2024-10-14 03:23:14,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6867f57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:23:14, skipping insertion in model container [2024-10-14 03:23:14,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 03:23:13" (2/3) ... [2024-10-14 03:23:14,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6867f57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 03:23:14, skipping insertion in model container [2024-10-14 03:23:14,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 03:23:14" (3/3) ... [2024-10-14 03:23:14,116 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.06.cil-2.c [2024-10-14 03:23:14,128 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 03:23:14,128 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 03:23:14,206 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 03:23:14,214 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;@4c0f2f53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 03:23:14,214 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 03:23:14,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 182 states have (on average 1.7087912087912087) internal successors, (311), 184 states have internal predecessors, (311), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 03:23:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:14,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:14,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:14,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:14,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash -938107551, now seen corresponding path program 1 times [2024-10-14 03:23:14,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997844201] [2024-10-14 03:23:14,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:14,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997844201] [2024-10-14 03:23:14,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997844201] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:14,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:14,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 03:23:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650452936] [2024-10-14 03:23:14,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:14,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 03:23:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:14,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 03:23:14,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 03:23:14,822 INFO L87 Difference]: Start difference. First operand has 210 states, 182 states have (on average 1.7087912087912087) internal successors, (311), 184 states have internal predecessors, (311), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:15,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:15,984 INFO L93 Difference]: Finished difference Result 486 states and 821 transitions. [2024-10-14 03:23:15,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 03:23:15,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:15,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:16,006 INFO L225 Difference]: With dead ends: 486 [2024-10-14 03:23:16,006 INFO L226 Difference]: Without dead ends: 278 [2024-10-14 03:23:16,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 03:23:16,016 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 553 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:16,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 379 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 03:23:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-10-14 03:23:16,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 208. [2024-10-14 03:23:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 181 states have (on average 1.5966850828729282) internal successors, (289), 182 states have internal predecessors, (289), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 03:23:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 329 transitions. [2024-10-14 03:23:16,100 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 329 transitions. Word has length 100 [2024-10-14 03:23:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:16,101 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 329 transitions. [2024-10-14 03:23:16,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:16,101 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 329 transitions. [2024-10-14 03:23:16,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:16,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:16,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:16,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 03:23:16,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:16,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:16,110 INFO L85 PathProgramCache]: Analyzing trace with hash 2005474527, now seen corresponding path program 1 times [2024-10-14 03:23:16,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:16,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168300071] [2024-10-14 03:23:16,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:16,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:16,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:16,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:16,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:16,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:16,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:16,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:16,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168300071] [2024-10-14 03:23:16,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168300071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:16,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:16,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:23:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530131899] [2024-10-14 03:23:16,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:16,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:23:16,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:16,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:23:16,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:23:16,441 INFO L87 Difference]: Start difference. First operand 208 states and 329 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:18,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:18,090 INFO L93 Difference]: Finished difference Result 747 states and 1211 transitions. [2024-10-14 03:23:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:23:18,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:18,095 INFO L225 Difference]: With dead ends: 747 [2024-10-14 03:23:18,095 INFO L226 Difference]: Without dead ends: 551 [2024-10-14 03:23:18,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:18,101 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 823 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:18,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 631 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:23:18,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-10-14 03:23:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 412. [2024-10-14 03:23:18,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 363 states have (on average 1.606060606060606) internal successors, (583), 365 states have internal predecessors, (583), 35 states have call successors, (35), 12 states have call predecessors, (35), 13 states have return successors, (38), 35 states have call predecessors, (38), 35 states have call successors, (38) [2024-10-14 03:23:18,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 656 transitions. [2024-10-14 03:23:18,176 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 656 transitions. Word has length 100 [2024-10-14 03:23:18,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:18,176 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 656 transitions. [2024-10-14 03:23:18,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 656 transitions. [2024-10-14 03:23:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:18,181 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:18,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:18,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 03:23:18,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:18,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash 748499615, now seen corresponding path program 1 times [2024-10-14 03:23:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:18,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325260532] [2024-10-14 03:23:18,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:18,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:18,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:18,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:18,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:18,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:18,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:18,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:18,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:18,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325260532] [2024-10-14 03:23:18,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325260532] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:18,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:18,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:18,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379286599] [2024-10-14 03:23:18,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:18,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:18,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:18,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:18,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:18,448 INFO L87 Difference]: Start difference. First operand 412 states and 656 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:20,544 INFO L93 Difference]: Finished difference Result 1232 states and 1993 transitions. [2024-10-14 03:23:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:23:20,545 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:20,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:20,550 INFO L225 Difference]: With dead ends: 1232 [2024-10-14 03:23:20,550 INFO L226 Difference]: Without dead ends: 832 [2024-10-14 03:23:20,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:23:20,553 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 836 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 849 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:20,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [849 Valid, 1186 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 03:23:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2024-10-14 03:23:20,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 601. [2024-10-14 03:23:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 530 states have (on average 1.5981132075471698) internal successors, (847), 533 states have internal predecessors, (847), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (55), 51 states have call predecessors, (55), 50 states have call successors, (55) [2024-10-14 03:23:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 952 transitions. [2024-10-14 03:23:20,612 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 952 transitions. Word has length 100 [2024-10-14 03:23:20,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:20,612 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 952 transitions. [2024-10-14 03:23:20,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:20,613 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 952 transitions. [2024-10-14 03:23:20,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:20,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:20,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:20,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 03:23:20,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:20,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:20,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1669984863, now seen corresponding path program 1 times [2024-10-14 03:23:20,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:20,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347518751] [2024-10-14 03:23:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:20,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:20,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:20,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:20,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:20,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:20,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:20,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347518751] [2024-10-14 03:23:20,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347518751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:20,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:20,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:20,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522713395] [2024-10-14 03:23:20,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:20,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:20,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:20,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:20,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:20,861 INFO L87 Difference]: Start difference. First operand 601 states and 952 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:22,666 INFO L93 Difference]: Finished difference Result 1942 states and 3133 transitions. [2024-10-14 03:23:22,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:23:22,667 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:22,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:22,675 INFO L225 Difference]: With dead ends: 1942 [2024-10-14 03:23:22,675 INFO L226 Difference]: Without dead ends: 1353 [2024-10-14 03:23:22,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:23:22,678 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 904 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:22,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 784 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:23:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-10-14 03:23:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 980. [2024-10-14 03:23:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 865 states have (on average 1.5907514450867053) internal successors, (1376), 870 states have internal predecessors, (1376), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-14 03:23:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1549 transitions. [2024-10-14 03:23:22,766 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1549 transitions. Word has length 100 [2024-10-14 03:23:22,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:22,767 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1549 transitions. [2024-10-14 03:23:22,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1549 transitions. [2024-10-14 03:23:22,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:22,769 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:22,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:22,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 03:23:22,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:22,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:22,770 INFO L85 PathProgramCache]: Analyzing trace with hash 745851487, now seen corresponding path program 1 times [2024-10-14 03:23:22,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:22,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701135063] [2024-10-14 03:23:22,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:22,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:22,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:22,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:22,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:22,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:22,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:22,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:22,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:22,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:22,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:22,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701135063] [2024-10-14 03:23:22,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701135063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:22,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:22,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:22,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114457088] [2024-10-14 03:23:22,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:22,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:22,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:22,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:22,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:22,974 INFO L87 Difference]: Start difference. First operand 980 states and 1549 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:23,942 INFO L93 Difference]: Finished difference Result 2307 states and 3715 transitions. [2024-10-14 03:23:23,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:23,943 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:23,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:23,952 INFO L225 Difference]: With dead ends: 2307 [2024-10-14 03:23:23,952 INFO L226 Difference]: Without dead ends: 1339 [2024-10-14 03:23:23,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:23,956 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 700 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:23,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 505 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:23:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-10-14 03:23:24,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 980. [2024-10-14 03:23:24,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 865 states have (on average 1.584971098265896) internal successors, (1371), 870 states have internal predecessors, (1371), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-14 03:23:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1544 transitions. [2024-10-14 03:23:24,027 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1544 transitions. Word has length 100 [2024-10-14 03:23:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:24,027 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1544 transitions. [2024-10-14 03:23:24,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1544 transitions. [2024-10-14 03:23:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:24,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:24,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:24,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 03:23:24,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:24,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:24,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1982357859, now seen corresponding path program 1 times [2024-10-14 03:23:24,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:24,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321658962] [2024-10-14 03:23:24,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:24,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:24,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:24,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:24,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:24,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321658962] [2024-10-14 03:23:24,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321658962] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:24,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:24,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:24,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794218199] [2024-10-14 03:23:24,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:24,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:24,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:24,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:24,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:24,212 INFO L87 Difference]: Start difference. First operand 980 states and 1544 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:25,134 INFO L93 Difference]: Finished difference Result 2301 states and 3688 transitions. [2024-10-14 03:23:25,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:25,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:25,143 INFO L225 Difference]: With dead ends: 2301 [2024-10-14 03:23:25,143 INFO L226 Difference]: Without dead ends: 1333 [2024-10-14 03:23:25,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:25,149 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 698 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:25,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 505 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:23:25,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2024-10-14 03:23:25,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 980. [2024-10-14 03:23:25,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 980 states, 865 states have (on average 1.5791907514450867) internal successors, (1366), 870 states have internal predecessors, (1366), 80 states have call successors, (80), 30 states have call predecessors, (80), 34 states have return successors, (93), 83 states have call predecessors, (93), 80 states have call successors, (93) [2024-10-14 03:23:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 1539 transitions. [2024-10-14 03:23:25,264 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 1539 transitions. Word has length 100 [2024-10-14 03:23:25,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:25,264 INFO L471 AbstractCegarLoop]: Abstraction has 980 states and 1539 transitions. [2024-10-14 03:23:25,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 1539 transitions. [2024-10-14 03:23:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:25,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:25,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:25,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 03:23:25,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:25,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:25,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1254771359, now seen corresponding path program 1 times [2024-10-14 03:23:25,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:25,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128165562] [2024-10-14 03:23:25,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:25,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:25,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:25,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:25,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128165562] [2024-10-14 03:23:25,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128165562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:25,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:25,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:25,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941752103] [2024-10-14 03:23:25,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:25,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:25,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:25,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:25,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:25,471 INFO L87 Difference]: Start difference. First operand 980 states and 1539 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:27,312 INFO L93 Difference]: Finished difference Result 3290 states and 5238 transitions. [2024-10-14 03:23:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 03:23:27,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:27,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:27,323 INFO L225 Difference]: With dead ends: 3290 [2024-10-14 03:23:27,324 INFO L226 Difference]: Without dead ends: 2322 [2024-10-14 03:23:27,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 03:23:27,328 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 820 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1184 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:27,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1184 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:23:27,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states. [2024-10-14 03:23:27,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 1754. [2024-10-14 03:23:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1551 states have (on average 1.5718891038039975) internal successors, (2438), 1560 states have internal predecessors, (2438), 140 states have call successors, (140), 54 states have call predecessors, (140), 62 states have return successors, (175), 147 states have call predecessors, (175), 140 states have call successors, (175) [2024-10-14 03:23:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2753 transitions. [2024-10-14 03:23:27,458 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2753 transitions. Word has length 100 [2024-10-14 03:23:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:27,459 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2753 transitions. [2024-10-14 03:23:27,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:27,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2753 transitions. [2024-10-14 03:23:27,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:27,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:27,464 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:27,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 03:23:27,464 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:27,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:27,465 INFO L85 PathProgramCache]: Analyzing trace with hash 112268893, now seen corresponding path program 1 times [2024-10-14 03:23:27,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:27,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243283458] [2024-10-14 03:23:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:27,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:27,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:27,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243283458] [2024-10-14 03:23:27,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243283458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:27,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:27,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:27,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576724420] [2024-10-14 03:23:27,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:27,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:27,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:27,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:27,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:27,644 INFO L87 Difference]: Start difference. First operand 1754 states and 2753 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:29,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:29,512 INFO L93 Difference]: Finished difference Result 6662 states and 10600 transitions. [2024-10-14 03:23:29,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:29,513 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:29,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:29,537 INFO L225 Difference]: With dead ends: 6662 [2024-10-14 03:23:29,537 INFO L226 Difference]: Without dead ends: 4920 [2024-10-14 03:23:29,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:29,546 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1043 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:29,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1177 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:23:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4920 states. [2024-10-14 03:23:29,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4920 to 3287. [2024-10-14 03:23:29,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3287 states, 2916 states have (on average 1.5679012345679013) internal successors, (4572), 2933 states have internal predecessors, (4572), 252 states have call successors, (252), 102 states have call predecessors, (252), 118 states have return successors, (349), 267 states have call predecessors, (349), 252 states have call successors, (349) [2024-10-14 03:23:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3287 states to 3287 states and 5173 transitions. [2024-10-14 03:23:29,811 INFO L78 Accepts]: Start accepts. Automaton has 3287 states and 5173 transitions. Word has length 100 [2024-10-14 03:23:29,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:29,812 INFO L471 AbstractCegarLoop]: Abstraction has 3287 states and 5173 transitions. [2024-10-14 03:23:29,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3287 states and 5173 transitions. [2024-10-14 03:23:29,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:29,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:29,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:29,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 03:23:29,816 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:29,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:29,816 INFO L85 PathProgramCache]: Analyzing trace with hash 352508639, now seen corresponding path program 1 times [2024-10-14 03:23:29,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:29,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874323750] [2024-10-14 03:23:29,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:29,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:29,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:29,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:29,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:29,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:30,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:30,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:30,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:30,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874323750] [2024-10-14 03:23:30,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874323750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:30,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:30,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:30,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676593459] [2024-10-14 03:23:30,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:30,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:30,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:30,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:30,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:30,006 INFO L87 Difference]: Start difference. First operand 3287 states and 5173 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:32,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:32,262 INFO L93 Difference]: Finished difference Result 12537 states and 19994 transitions. [2024-10-14 03:23:32,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:32,263 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:32,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:32,309 INFO L225 Difference]: With dead ends: 12537 [2024-10-14 03:23:32,309 INFO L226 Difference]: Without dead ends: 9262 [2024-10-14 03:23:32,324 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:32,325 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 864 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 2313 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 2366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:32,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 1173 Invalid, 2366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2313 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 03:23:32,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9262 states. [2024-10-14 03:23:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9262 to 6272. [2024-10-14 03:23:32,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 5573 states have (on average 1.5657635026018302) internal successors, (8726), 5606 states have internal predecessors, (8726), 468 states have call successors, (468), 198 states have call predecessors, (468), 230 states have return successors, (743), 499 states have call predecessors, (743), 468 states have call successors, (743) [2024-10-14 03:23:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 9937 transitions. [2024-10-14 03:23:32,885 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 9937 transitions. Word has length 100 [2024-10-14 03:23:32,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:32,885 INFO L471 AbstractCegarLoop]: Abstraction has 6272 states and 9937 transitions. [2024-10-14 03:23:32,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:32,886 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 9937 transitions. [2024-10-14 03:23:32,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:32,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:32,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:32,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 03:23:32,892 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:32,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:32,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1191542301, now seen corresponding path program 1 times [2024-10-14 03:23:32,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:32,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651961087] [2024-10-14 03:23:32,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:32,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:32,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:32,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:33,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:33,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:33,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651961087] [2024-10-14 03:23:33,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651961087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:33,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:33,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:33,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477716069] [2024-10-14 03:23:33,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:33,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:33,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:33,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:33,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:33,042 INFO L87 Difference]: Start difference. First operand 6272 states and 9937 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:34,289 INFO L93 Difference]: Finished difference Result 14361 states and 23119 transitions. [2024-10-14 03:23:34,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:34,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:34,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:34,343 INFO L225 Difference]: With dead ends: 14361 [2024-10-14 03:23:34,343 INFO L226 Difference]: Without dead ends: 8101 [2024-10-14 03:23:34,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:34,367 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 611 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:34,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 601 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 03:23:34,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8101 states. [2024-10-14 03:23:34,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8101 to 6272. [2024-10-14 03:23:34,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 5573 states have (on average 1.559842095819128) internal successors, (8693), 5606 states have internal predecessors, (8693), 468 states have call successors, (468), 198 states have call predecessors, (468), 230 states have return successors, (743), 499 states have call predecessors, (743), 468 states have call successors, (743) [2024-10-14 03:23:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 9904 transitions. [2024-10-14 03:23:34,884 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 9904 transitions. Word has length 100 [2024-10-14 03:23:34,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:34,884 INFO L471 AbstractCegarLoop]: Abstraction has 6272 states and 9904 transitions. [2024-10-14 03:23:34,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:34,885 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 9904 transitions. [2024-10-14 03:23:34,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:34,891 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:34,891 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:34,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 03:23:34,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:34,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:34,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1218607903, now seen corresponding path program 1 times [2024-10-14 03:23:34,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:34,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618845568] [2024-10-14 03:23:34,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:34,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:34,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:35,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:35,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:35,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:35,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:35,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618845568] [2024-10-14 03:23:35,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618845568] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:35,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:35,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:35,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778255996] [2024-10-14 03:23:35,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:35,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:35,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:35,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:35,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:35,103 INFO L87 Difference]: Start difference. First operand 6272 states and 9904 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:37,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:37,697 INFO L93 Difference]: Finished difference Result 23406 states and 37392 transitions. [2024-10-14 03:23:37,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:37,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:37,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:37,754 INFO L225 Difference]: With dead ends: 23406 [2024-10-14 03:23:37,754 INFO L226 Difference]: Without dead ends: 17146 [2024-10-14 03:23:37,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:37,780 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 986 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 1632 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:37,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 784 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1632 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 03:23:37,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17146 states. [2024-10-14 03:23:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17146 to 12354. [2024-10-14 03:23:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12354 states, 11015 states have (on average 1.5579664094416705) internal successors, (17161), 11080 states have internal predecessors, (17161), 884 states have call successors, (884), 390 states have call predecessors, (884), 454 states have return successors, (1677), 947 states have call predecessors, (1677), 884 states have call successors, (1677) [2024-10-14 03:23:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12354 states to 12354 states and 19722 transitions. [2024-10-14 03:23:38,857 INFO L78 Accepts]: Start accepts. Automaton has 12354 states and 19722 transitions. Word has length 100 [2024-10-14 03:23:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:38,858 INFO L471 AbstractCegarLoop]: Abstraction has 12354 states and 19722 transitions. [2024-10-14 03:23:38,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 12354 states and 19722 transitions. [2024-10-14 03:23:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:38,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:38,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:38,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 03:23:38,868 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:38,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:38,868 INFO L85 PathProgramCache]: Analyzing trace with hash -858728995, now seen corresponding path program 1 times [2024-10-14 03:23:38,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:38,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325184939] [2024-10-14 03:23:38,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:38,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:38,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:38,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:39,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:39,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:39,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:39,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:39,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:39,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:39,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325184939] [2024-10-14 03:23:39,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325184939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:39,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:39,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:39,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521650309] [2024-10-14 03:23:39,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:39,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:39,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:39,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:39,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:39,023 INFO L87 Difference]: Start difference. First operand 12354 states and 19722 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:40,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:40,670 INFO L93 Difference]: Finished difference Result 27959 states and 45370 transitions. [2024-10-14 03:23:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 03:23:40,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:40,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:40,734 INFO L225 Difference]: With dead ends: 27959 [2024-10-14 03:23:40,734 INFO L226 Difference]: Without dead ends: 15617 [2024-10-14 03:23:40,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 03:23:40,775 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 614 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 628 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:40,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [628 Valid, 601 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 03:23:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15617 states. [2024-10-14 03:23:41,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15617 to 12354. [2024-10-14 03:23:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12354 states, 11015 states have (on average 1.5520653654108034) internal successors, (17096), 11080 states have internal predecessors, (17096), 884 states have call successors, (884), 390 states have call predecessors, (884), 454 states have return successors, (1677), 947 states have call predecessors, (1677), 884 states have call successors, (1677) [2024-10-14 03:23:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12354 states to 12354 states and 19657 transitions. [2024-10-14 03:23:42,026 INFO L78 Accepts]: Start accepts. Automaton has 12354 states and 19657 transitions. Word has length 100 [2024-10-14 03:23:42,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:42,026 INFO L471 AbstractCegarLoop]: Abstraction has 12354 states and 19657 transitions. [2024-10-14 03:23:42,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 12354 states and 19657 transitions. [2024-10-14 03:23:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:42,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:42,037 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:42,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 03:23:42,038 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:42,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash 28493851, now seen corresponding path program 1 times [2024-10-14 03:23:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:42,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794837487] [2024-10-14 03:23:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:42,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:42,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:42,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:42,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:42,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794837487] [2024-10-14 03:23:42,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794837487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:42,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:42,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 03:23:42,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876935071] [2024-10-14 03:23:42,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:42,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 03:23:42,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:42,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 03:23:42,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:42,193 INFO L87 Difference]: Start difference. First operand 12354 states and 19657 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:45,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:45,711 INFO L93 Difference]: Finished difference Result 43658 states and 70316 transitions. [2024-10-14 03:23:45,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 03:23:45,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:45,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:45,830 INFO L225 Difference]: With dead ends: 43658 [2024-10-14 03:23:45,830 INFO L226 Difference]: Without dead ends: 31316 [2024-10-14 03:23:45,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 03:23:45,868 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 803 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1987 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 1987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:45,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1177 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 1987 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 03:23:45,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31316 states. [2024-10-14 03:23:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31316 to 24645. [2024-10-14 03:23:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24645 states, 22058 states have (on average 1.551455254329495) internal successors, (34222), 22187 states have internal predecessors, (34222), 1684 states have call successors, (1684), 774 states have call predecessors, (1684), 902 states have return successors, (3999), 1811 states have call predecessors, (3999), 1684 states have call successors, (3999) [2024-10-14 03:23:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24645 states to 24645 states and 39905 transitions. [2024-10-14 03:23:48,047 INFO L78 Accepts]: Start accepts. Automaton has 24645 states and 39905 transitions. Word has length 100 [2024-10-14 03:23:48,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:48,047 INFO L471 AbstractCegarLoop]: Abstraction has 24645 states and 39905 transitions. [2024-10-14 03:23:48,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:48,048 INFO L276 IsEmpty]: Start isEmpty. Operand 24645 states and 39905 transitions. [2024-10-14 03:23:48,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 03:23:48,069 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:48,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:48,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 03:23:48,069 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:48,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1882548707, now seen corresponding path program 1 times [2024-10-14 03:23:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:48,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620528797] [2024-10-14 03:23:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:48,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 03:23:48,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:48,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620528797] [2024-10-14 03:23:48,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620528797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:48,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 03:23:48,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 03:23:48,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421942081] [2024-10-14 03:23:48,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:48,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 03:23:48,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:48,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 03:23:48,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 03:23:48,226 INFO L87 Difference]: Start difference. First operand 24645 states and 39905 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:52,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:52,161 INFO L93 Difference]: Finished difference Result 70272 states and 113710 transitions. [2024-10-14 03:23:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 03:23:52,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-10-14 03:23:52,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:23:52,326 INFO L225 Difference]: With dead ends: 70272 [2024-10-14 03:23:52,326 INFO L226 Difference]: Without dead ends: 45640 [2024-10-14 03:23:52,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 03:23:52,392 INFO L432 NwaCegarLoop]: 328 mSDtfsCounter, 1052 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:23:52,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 910 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 03:23:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45640 states. [2024-10-14 03:23:54,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45640 to 36885. [2024-10-14 03:23:54,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36885 states, 32964 states have (on average 1.5430166241960928) internal successors, (50864), 33222 states have internal predecessors, (50864), 2564 states have call successors, (2564), 1164 states have call predecessors, (2564), 1356 states have return successors, (5609), 2626 states have call predecessors, (5609), 2564 states have call successors, (5609) [2024-10-14 03:23:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36885 states to 36885 states and 59037 transitions. [2024-10-14 03:23:54,948 INFO L78 Accepts]: Start accepts. Automaton has 36885 states and 59037 transitions. Word has length 100 [2024-10-14 03:23:54,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:23:54,949 INFO L471 AbstractCegarLoop]: Abstraction has 36885 states and 59037 transitions. [2024-10-14 03:23:54,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-14 03:23:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 36885 states and 59037 transitions. [2024-10-14 03:23:55,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 03:23:55,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:23:55,237 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:23:55,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 03:23:55,237 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:23:55,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:23:55,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1318711564, now seen corresponding path program 1 times [2024-10-14 03:23:55,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:23:55,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12352893] [2024-10-14 03:23:55,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:55,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:23:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:23:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:23:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:23:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:23:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:23:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 03:23:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:23:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 03:23:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,420 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 03:23:55,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:23:55,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12352893] [2024-10-14 03:23:55,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12352893] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:23:55,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951696143] [2024-10-14 03:23:55,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:23:55,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:23:55,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:23:55,422 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-10-14 03:23:55,424 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-10-14 03:23:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:23:55,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 650 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:23:55,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:23:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 03:23:55,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:23:55,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951696143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:23:55,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:23:55,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 03:23:55,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113753667] [2024-10-14 03:23:55,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:23:55,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:23:55,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:23:55,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:23:55,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:23:55,663 INFO L87 Difference]: Start difference. First operand 36885 states and 59037 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:23:59,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 03:23:59,937 INFO L93 Difference]: Finished difference Result 110044 states and 177361 transitions. [2024-10-14 03:23:59,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 03:23:59,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 162 [2024-10-14 03:23:59,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 03:24:00,396 INFO L225 Difference]: With dead ends: 110044 [2024-10-14 03:24:00,396 INFO L226 Difference]: Without dead ends: 73172 [2024-10-14 03:24:00,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:00,498 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 274 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 03:24:00,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 568 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 03:24:00,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73172 states. [2024-10-14 03:24:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73172 to 72976. [2024-10-14 03:24:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72976 states, 65237 states have (on average 1.5397550469825405) internal successors, (100449), 65752 states have internal predecessors, (100449), 5026 states have call successors, (5026), 2328 states have call predecessors, (5026), 2712 states have return successors, (10989), 5023 states have call predecessors, (10989), 5026 states have call successors, (10989) [2024-10-14 03:24:06,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72976 states to 72976 states and 116464 transitions. [2024-10-14 03:24:06,082 INFO L78 Accepts]: Start accepts. Automaton has 72976 states and 116464 transitions. Word has length 162 [2024-10-14 03:24:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 03:24:06,083 INFO L471 AbstractCegarLoop]: Abstraction has 72976 states and 116464 transitions. [2024-10-14 03:24:06,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-14 03:24:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 72976 states and 116464 transitions. [2024-10-14 03:24:06,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 03:24:06,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 03:24:06,200 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:24:06,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 03:24:06,404 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,SelfDestructingSolverStorable14 [2024-10-14 03:24:06,405 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 03:24:06,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 03:24:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash -352874604, now seen corresponding path program 1 times [2024-10-14 03:24:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 03:24:06,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972868272] [2024-10-14 03:24:06,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:06,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 03:24:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 03:24:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 03:24:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 03:24:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 03:24:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 03:24:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 03:24:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-14 03:24:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 03:24:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 03:24:06,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 03:24:06,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972868272] [2024-10-14 03:24:06,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972868272] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 03:24:06,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347206604] [2024-10-14 03:24:06,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 03:24:06,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 03:24:06,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 03:24:06,583 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-10-14 03:24:06,584 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-10-14 03:24:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 03:24:06,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 03:24:06,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 03:24:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 03:24:06,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 03:24:06,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347206604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 03:24:06,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 03:24:06,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-14 03:24:06,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794339196] [2024-10-14 03:24:06,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 03:24:06,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 03:24:06,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 03:24:06,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 03:24:06,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 03:24:06,798 INFO L87 Difference]: Start difference. First operand 72976 states and 116464 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)