./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.10.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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.10.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 6ba9401cadb8fecd59a1a331c94e3215cc972a92f03516bfd6c95164e3ec98a9 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:55:35,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:55:36,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:55:36,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:55:36,069 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:55:36,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:55:36,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:55:36,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:55:36,093 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:55:36,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:55:36,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:55:36,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:55:36,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:55:36,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:55:36,096 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:55:36,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:55:36,098 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:55:36,099 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:55:36,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:55:36,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:55:36,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:55:36,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:55:36,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:55:36,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:55:36,100 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:55:36,100 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:55:36,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:55:36,100 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:55:36,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:55:36,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:55:36,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:55:36,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:55:36,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:55:36,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:55:36,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:55:36,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:55:36,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:55:36,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:55:36,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:55:36,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:55:36,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:55:36,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:55:36,104 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 -> 6ba9401cadb8fecd59a1a331c94e3215cc972a92f03516bfd6c95164e3ec98a9 [2024-10-12 19:55:36,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:55:36,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:55:36,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:55:36,376 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:55:36,380 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:55:36,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-2.c [2024-10-12 19:55:37,710 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:55:37,941 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:55:37,941 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.10.cil-2.c [2024-10-12 19:55:37,951 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6df66e7e/3be006c4f39a45ba9541a67443fcd15e/FLAG49351d9fb [2024-10-12 19:55:37,964 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6df66e7e/3be006c4f39a45ba9541a67443fcd15e [2024-10-12 19:55:37,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:55:37,967 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:55:37,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:55:37,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:55:37,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:55:37,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:55:37" (1/1) ... [2024-10-12 19:55:37,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dc5637f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:37, skipping insertion in model container [2024-10-12 19:55:37,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:55:37" (1/1) ... [2024-10-12 19:55:38,021 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:55:38,163 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.10.cil-2.c[671,684] [2024-10-12 19:55:38,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:55:38,296 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:55:38,307 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.10.cil-2.c[671,684] [2024-10-12 19:55:38,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:55:38,388 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:55:38,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38 WrapperNode [2024-10-12 19:55:38,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:55:38,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:55:38,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:55:38,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:55:38,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,458 INFO L138 Inliner]: procedures = 48, calls = 61, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 759 [2024-10-12 19:55:38,459 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:55:38,459 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:55:38,459 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:55:38,460 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:55:38,469 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,470 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,486 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-12 19:55:38,490 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,515 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:55:38,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:55:38,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:55:38,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:55:38,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (1/1) ... [2024-10-12 19:55:38,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:55:38,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:55:38,563 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-12 19:55:38,569 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-12 19:55:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:55:38,607 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 19:55:38,608 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 19:55:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 19:55:38,608 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 19:55:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 19:55:38,608 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 19:55:38,608 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 19:55:38,608 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 19:55:38,609 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 19:55:38,609 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 19:55:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:55:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 19:55:38,610 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 19:55:38,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:55:38,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:55:38,703 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:55:38,705 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:55:39,385 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-10-12 19:55:39,386 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:55:39,435 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:55:39,435 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-12 19:55:39,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:55:39 BoogieIcfgContainer [2024-10-12 19:55:39,438 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:55:39,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:55:39,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:55:39,441 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:55:39,443 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:55:37" (1/3) ... [2024-10-12 19:55:39,443 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19748fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:55:39, skipping insertion in model container [2024-10-12 19:55:39,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:55:38" (2/3) ... [2024-10-12 19:55:39,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19748fa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:55:39, skipping insertion in model container [2024-10-12 19:55:39,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:55:39" (3/3) ... [2024-10-12 19:55:39,445 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.10.cil-2.c [2024-10-12 19:55:39,457 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:55:39,458 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:55:39,530 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:55:39,535 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;@39352fa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:55:39,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:55:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 270 states have (on average 1.7296296296296296) internal successors, (467), 272 states have internal predecessors, (467), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 19:55:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:55:39,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:39,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:55:39,553 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:39,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:39,558 INFO L85 PathProgramCache]: Analyzing trace with hash 149152853, now seen corresponding path program 1 times [2024-10-12 19:55:39,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:39,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333699854] [2024-10-12 19:55:39,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:39,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:39,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:40,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:55:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:55:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:40,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:55:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:40,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:55:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:40,176 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-12 19:55:40,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:40,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333699854] [2024-10-12 19:55:40,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333699854] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:40,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:40,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:55:40,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619550576] [2024-10-12 19:55:40,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:40,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:55:40,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:40,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:55:40,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:55:40,227 INFO L87 Difference]: Start difference. First operand has 302 states, 270 states have (on average 1.7296296296296296) internal successors, (467), 272 states have internal predecessors, (467), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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-12 19:55:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:41,824 INFO L93 Difference]: Finished difference Result 710 states and 1221 transitions. [2024-10-12 19:55:41,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:55:41,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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 140 [2024-10-12 19:55:41,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:41,844 INFO L225 Difference]: With dead ends: 710 [2024-10-12 19:55:41,845 INFO L226 Difference]: Without dead ends: 410 [2024-10-12 19:55:41,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:55:41,856 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 837 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:41,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 543 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 19:55:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-12 19:55:41,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 300. [2024-10-12 19:55:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 269 states have (on average 1.6245353159851301) internal successors, (437), 270 states have internal predecessors, (437), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 19:55:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 485 transitions. [2024-10-12 19:55:41,964 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 485 transitions. Word has length 140 [2024-10-12 19:55:41,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:41,979 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 485 transitions. [2024-10-12 19:55:41,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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-12 19:55:41,980 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 485 transitions. [2024-10-12 19:55:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:55:41,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:41,983 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:55:41,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:55:41,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:41,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:41,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1249800749, now seen corresponding path program 1 times [2024-10-12 19:55:41,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:41,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187040906] [2024-10-12 19:55:41,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:41,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:42,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:42,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:42,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:55:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:42,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:55:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:42,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:55:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:42,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:55:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:42,389 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-12 19:55:42,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:42,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187040906] [2024-10-12 19:55:42,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187040906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:42,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:42,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 19:55:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698204285] [2024-10-12 19:55:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:42,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:55:42,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:42,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:55:42,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 19:55:42,393 INFO L87 Difference]: Start difference. First operand 300 states and 485 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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-12 19:55:43,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:43,535 INFO L93 Difference]: Finished difference Result 698 states and 1146 transitions. [2024-10-12 19:55:43,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:55:43,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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 140 [2024-10-12 19:55:43,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:43,539 INFO L225 Difference]: With dead ends: 698 [2024-10-12 19:55:43,540 INFO L226 Difference]: Without dead ends: 410 [2024-10-12 19:55:43,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:55:43,542 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 826 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:43,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 538 Invalid, 951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 19:55:43,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2024-10-12 19:55:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 300. [2024-10-12 19:55:43,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 269 states have (on average 1.620817843866171) internal successors, (436), 270 states have internal predecessors, (436), 24 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-12 19:55:43,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 484 transitions. [2024-10-12 19:55:43,587 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 484 transitions. Word has length 140 [2024-10-12 19:55:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:43,592 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 484 transitions. [2024-10-12 19:55:43,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 3 states have internal predecessors, (130), 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-12 19:55:43,592 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 484 transitions. [2024-10-12 19:55:43,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:55:43,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:43,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:55:43,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:55:43,594 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:43,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash -815295151, now seen corresponding path program 1 times [2024-10-12 19:55:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722101190] [2024-10-12 19:55:43,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:43,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:43,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:43,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:55:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:43,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:55:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:43,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:55:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:43,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:55:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:43,853 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-12 19:55:43,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:43,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722101190] [2024-10-12 19:55:43,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722101190] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:43,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:43,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:55:43,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421440812] [2024-10-12 19:55:43,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:43,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:55:43,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:43,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:55:43,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:55:43,855 INFO L87 Difference]: Start difference. First operand 300 states and 484 transitions. Second operand has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 4 states have internal predecessors, (130), 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-12 19:55:45,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:45,834 INFO L93 Difference]: Finished difference Result 1103 states and 1822 transitions. [2024-10-12 19:55:45,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:55:45,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 4 states have internal predecessors, (130), 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 140 [2024-10-12 19:55:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:45,838 INFO L225 Difference]: With dead ends: 1103 [2024-10-12 19:55:45,838 INFO L226 Difference]: Without dead ends: 819 [2024-10-12 19:55:45,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:55:45,840 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 1258 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1275 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:45,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1275 Valid, 908 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 19:55:45,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2024-10-12 19:55:45,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 600. [2024-10-12 19:55:45,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 543 states have (on average 1.6316758747697975) internal successors, (886), 545 states have internal predecessors, (886), 43 states have call successors, (43), 12 states have call predecessors, (43), 13 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2024-10-12 19:55:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 975 transitions. [2024-10-12 19:55:45,871 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 975 transitions. Word has length 140 [2024-10-12 19:55:45,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:45,871 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 975 transitions. [2024-10-12 19:55:45,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.666666666666668) internal successors, (130), 4 states have internal predecessors, (130), 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-12 19:55:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 975 transitions. [2024-10-12 19:55:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:55:45,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:45,873 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:55:45,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:55:45,873 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:45,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:45,873 INFO L85 PathProgramCache]: Analyzing trace with hash -416103919, now seen corresponding path program 1 times [2024-10-12 19:55:45,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:45,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563812079] [2024-10-12 19:55:45,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:45,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:45,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:46,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:55:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:46,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:55:46,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:46,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:55:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:46,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:55:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:46,128 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-12 19:55:46,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:46,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563812079] [2024-10-12 19:55:46,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563812079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:46,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:46,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:46,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873895135] [2024-10-12 19:55:46,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:46,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:46,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:46,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:46,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:46,135 INFO L87 Difference]: Start difference. First operand 600 states and 975 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:55:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:48,952 INFO L93 Difference]: Finished difference Result 1828 states and 3020 transitions. [2024-10-12 19:55:48,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:55:48,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:55:48,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:48,962 INFO L225 Difference]: With dead ends: 1828 [2024-10-12 19:55:48,962 INFO L226 Difference]: Without dead ends: 1244 [2024-10-12 19:55:48,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:55:48,965 INFO L432 NwaCegarLoop]: 402 mSDtfsCounter, 1287 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 3176 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 1722 SdHoareTripleChecker+Invalid, 3233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 3176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:48,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 1722 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 3176 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 19:55:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-10-12 19:55:49,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 877. [2024-10-12 19:55:49,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 794 states have (on average 1.6246851385390428) internal successors, (1290), 797 states have internal predecessors, (1290), 62 states have call successors, (62), 18 states have call predecessors, (62), 20 states have return successors, (67), 63 states have call predecessors, (67), 62 states have call successors, (67) [2024-10-12 19:55:49,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1419 transitions. [2024-10-12 19:55:49,006 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1419 transitions. Word has length 140 [2024-10-12 19:55:49,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:49,006 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1419 transitions. [2024-10-12 19:55:49,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:55:49,007 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1419 transitions. [2024-10-12 19:55:49,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:55:49,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:49,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:55:49,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:55:49,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:49,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash 71943187, now seen corresponding path program 1 times [2024-10-12 19:55:49,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:49,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895935720] [2024-10-12 19:55:49,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:49,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:49,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:49,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:55:49,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:49,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:55:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:49,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:55:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:49,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:55:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:49,278 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-12 19:55:49,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:49,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895935720] [2024-10-12 19:55:49,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895935720] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:49,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:49,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:49,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290360216] [2024-10-12 19:55:49,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:49,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:49,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:49,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:49,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:49,285 INFO L87 Difference]: Start difference. First operand 877 states and 1419 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:55:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:51,954 INFO L93 Difference]: Finished difference Result 2890 states and 4764 transitions. [2024-10-12 19:55:51,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:55:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:55:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:51,962 INFO L225 Difference]: With dead ends: 2890 [2024-10-12 19:55:51,963 INFO L226 Difference]: Without dead ends: 2029 [2024-10-12 19:55:51,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:55:51,966 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1387 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 2629 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:51,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 1124 Invalid, 2720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2629 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 19:55:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2024-10-12 19:55:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 1432. [2024-10-12 19:55:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1297 states have (on average 1.6183500385505012) internal successors, (2099), 1302 states have internal predecessors, (2099), 100 states have call successors, (100), 30 states have call predecessors, (100), 34 states have return successors, (113), 103 states have call predecessors, (113), 100 states have call successors, (113) [2024-10-12 19:55:52,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2312 transitions. [2024-10-12 19:55:52,068 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2312 transitions. Word has length 140 [2024-10-12 19:55:52,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:52,069 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2312 transitions. [2024-10-12 19:55:52,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:55:52,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2312 transitions. [2024-10-12 19:55:52,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:55:52,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:52,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:55:52,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:55:52,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:52,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:52,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1020692015, now seen corresponding path program 1 times [2024-10-12 19:55:52,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:52,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902016779] [2024-10-12 19:55:52,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:52,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:52,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:55:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:52,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:55:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:52,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:55:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:52,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:55:52,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:52,265 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-12 19:55:52,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:52,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902016779] [2024-10-12 19:55:52,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902016779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:52,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:52,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:52,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626441680] [2024-10-12 19:55:52,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:52,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:52,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:52,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:52,268 INFO L87 Difference]: Start difference. First operand 1432 states and 2312 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:55:53,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:53,665 INFO L93 Difference]: Finished difference Result 3431 states and 5642 transitions. [2024-10-12 19:55:53,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:55:53,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:55:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:53,673 INFO L225 Difference]: With dead ends: 3431 [2024-10-12 19:55:53,673 INFO L226 Difference]: Without dead ends: 2015 [2024-10-12 19:55:53,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:55:53,677 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 925 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:53,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 882 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 19:55:53,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-10-12 19:55:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1432. [2024-10-12 19:55:53,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1297 states have (on average 1.6144949884348496) internal successors, (2094), 1302 states have internal predecessors, (2094), 100 states have call successors, (100), 30 states have call predecessors, (100), 34 states have return successors, (113), 103 states have call predecessors, (113), 100 states have call successors, (113) [2024-10-12 19:55:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2307 transitions. [2024-10-12 19:55:53,773 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2307 transitions. Word has length 140 [2024-10-12 19:55:53,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:53,773 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2307 transitions. [2024-10-12 19:55:53,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:55:53,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2307 transitions. [2024-10-12 19:55:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:55:53,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:53,776 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:55:53,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:55:53,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:53,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:53,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1431799567, now seen corresponding path program 1 times [2024-10-12 19:55:53,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:53,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745646300] [2024-10-12 19:55:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:53,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:53,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:53,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:53,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:55:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:53,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:55:53,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:53,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:55:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:54,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:55:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:54,006 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-12 19:55:54,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:54,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745646300] [2024-10-12 19:55:54,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745646300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:54,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:54,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:54,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922146871] [2024-10-12 19:55:54,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:54,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:54,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:54,008 INFO L87 Difference]: Start difference. First operand 1432 states and 2307 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:55:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:55,269 INFO L93 Difference]: Finished difference Result 3425 states and 5615 transitions. [2024-10-12 19:55:55,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:55:55,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:55:55,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:55,277 INFO L225 Difference]: With dead ends: 3425 [2024-10-12 19:55:55,277 INFO L226 Difference]: Without dead ends: 2009 [2024-10-12 19:55:55,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:55:55,286 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 1053 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1437 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:55,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 742 Invalid, 1522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1437 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:55:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2024-10-12 19:55:55,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 1432. [2024-10-12 19:55:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1297 states have (on average 1.610639938319198) internal successors, (2089), 1302 states have internal predecessors, (2089), 100 states have call successors, (100), 30 states have call predecessors, (100), 34 states have return successors, (113), 103 states have call predecessors, (113), 100 states have call successors, (113) [2024-10-12 19:55:55,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 2302 transitions. [2024-10-12 19:55:55,359 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 2302 transitions. Word has length 140 [2024-10-12 19:55:55,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:55,360 INFO L471 AbstractCegarLoop]: Abstraction has 1432 states and 2302 transitions. [2024-10-12 19:55:55,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:55:55,361 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 2302 transitions. [2024-10-12 19:55:55,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:55:55,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:55,362 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:55:55,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:55:55,363 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:55,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:55,363 INFO L85 PathProgramCache]: Analyzing trace with hash -290203119, now seen corresponding path program 1 times [2024-10-12 19:55:55,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:55,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945202226] [2024-10-12 19:55:55,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:55,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:55,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:55,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:55:55,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:55:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:55,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:55:55,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:55,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:55:55,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:55,576 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-12 19:55:55,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:55,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945202226] [2024-10-12 19:55:55,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945202226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:55,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:55,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:55,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661486794] [2024-10-12 19:55:55,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:55,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:55,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:55,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:55,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:55,578 INFO L87 Difference]: Start difference. First operand 1432 states and 2302 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:55:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:55:58,287 INFO L93 Difference]: Finished difference Result 4910 states and 8013 transitions. [2024-10-12 19:55:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:55:58,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:55:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:55:58,300 INFO L225 Difference]: With dead ends: 4910 [2024-10-12 19:55:58,300 INFO L226 Difference]: Without dead ends: 3494 [2024-10-12 19:55:58,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:55:58,304 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 1271 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 3096 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 3155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:55:58,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 1720 Invalid, 3155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3096 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 19:55:58,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3494 states. [2024-10-12 19:55:58,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3494 to 2558. [2024-10-12 19:55:58,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2319 states have (on average 1.6045709357481672) internal successors, (3721), 2328 states have internal predecessors, (3721), 176 states have call successors, (176), 54 states have call predecessors, (176), 62 states have return successors, (211), 183 states have call predecessors, (211), 176 states have call successors, (211) [2024-10-12 19:55:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 4108 transitions. [2024-10-12 19:55:58,456 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 4108 transitions. Word has length 140 [2024-10-12 19:55:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:55:58,456 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 4108 transitions. [2024-10-12 19:55:58,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:55:58,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 4108 transitions. [2024-10-12 19:55:58,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:55:58,459 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:55:58,459 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:55:58,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:55:58,459 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:55:58,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:55:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash -622846257, now seen corresponding path program 1 times [2024-10-12 19:55:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:55:58,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319426003] [2024-10-12 19:55:58,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:55:58,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:55:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:58,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:55:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:58,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:55:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:58,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:55:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:58,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:55:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:58,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:55:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:55:58,806 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-12 19:55:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:55:58,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319426003] [2024-10-12 19:55:58,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319426003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:55:58,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:55:58,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:55:58,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307776255] [2024-10-12 19:55:58,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:55:58,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:55:58,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:55:58,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:55:58,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:55:58,812 INFO L87 Difference]: Start difference. First operand 2558 states and 4108 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:00,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:00,270 INFO L93 Difference]: Finished difference Result 6053 states and 9878 transitions. [2024-10-12 19:56:00,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:56:00,270 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:56:00,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:00,282 INFO L225 Difference]: With dead ends: 6053 [2024-10-12 19:56:00,283 INFO L226 Difference]: Without dead ends: 3511 [2024-10-12 19:56:00,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:56:00,291 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 922 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:00,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 882 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 19:56:00,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2024-10-12 19:56:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 2558. [2024-10-12 19:56:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2319 states have (on average 1.6006899525657612) internal successors, (3712), 2328 states have internal predecessors, (3712), 176 states have call successors, (176), 54 states have call predecessors, (176), 62 states have return successors, (211), 183 states have call predecessors, (211), 176 states have call successors, (211) [2024-10-12 19:56:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 4099 transitions. [2024-10-12 19:56:00,460 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 4099 transitions. Word has length 140 [2024-10-12 19:56:00,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:56:00,462 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 4099 transitions. [2024-10-12 19:56:00,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 4099 transitions. [2024-10-12 19:56:00,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:56:00,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:56:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:56:00,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:56:00,464 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:56:00,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:56:00,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1306085969, now seen corresponding path program 1 times [2024-10-12 19:56:00,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:56:00,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870148492] [2024-10-12 19:56:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:56:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:56:00,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:00,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:56:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:00,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:56:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:56:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:00,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:56:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:00,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:56:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:00,722 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-12 19:56:00,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:56:00,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870148492] [2024-10-12 19:56:00,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870148492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:56:00,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:56:00,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:56:00,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563193313] [2024-10-12 19:56:00,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:56:00,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:56:00,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:56:00,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:56:00,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:56:00,724 INFO L87 Difference]: Start difference. First operand 2558 states and 4099 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:03,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:03,678 INFO L93 Difference]: Finished difference Result 8976 states and 14581 transitions. [2024-10-12 19:56:03,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:56:03,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:56:03,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:03,701 INFO L225 Difference]: With dead ends: 8976 [2024-10-12 19:56:03,701 INFO L226 Difference]: Without dead ends: 6434 [2024-10-12 19:56:03,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:56:03,708 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 1263 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 3117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:03,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1280 Valid, 1720 Invalid, 3117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 19:56:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6434 states. [2024-10-12 19:56:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6434 to 4820. [2024-10-12 19:56:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4820 states, 4373 states have (on average 1.5952435399039562) internal successors, (6976), 4390 states have internal predecessors, (6976), 328 states have call successors, (328), 102 states have call predecessors, (328), 118 states have return successors, (425), 343 states have call predecessors, (425), 328 states have call successors, (425) [2024-10-12 19:56:04,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4820 states to 4820 states and 7729 transitions. [2024-10-12 19:56:04,059 INFO L78 Accepts]: Start accepts. Automaton has 4820 states and 7729 transitions. Word has length 140 [2024-10-12 19:56:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:56:04,060 INFO L471 AbstractCegarLoop]: Abstraction has 4820 states and 7729 transitions. [2024-10-12 19:56:04,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 4820 states and 7729 transitions. [2024-10-12 19:56:04,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:56:04,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:56:04,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:56:04,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:56:04,068 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:56:04,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:56:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash -986995057, now seen corresponding path program 1 times [2024-10-12 19:56:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:56:04,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498459877] [2024-10-12 19:56:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:56:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:56:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:04,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:56:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:04,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:56:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:56:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:04,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:56:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:04,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:56:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:04,285 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-12 19:56:04,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:56:04,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498459877] [2024-10-12 19:56:04,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498459877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:56:04,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:56:04,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:56:04,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811239420] [2024-10-12 19:56:04,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:56:04,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:56:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:56:04,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:56:04,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:56:04,287 INFO L87 Difference]: Start difference. First operand 4820 states and 7729 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:07,391 INFO L93 Difference]: Finished difference Result 17124 states and 27849 transitions. [2024-10-12 19:56:07,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:56:07,392 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:56:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:07,428 INFO L225 Difference]: With dead ends: 17124 [2024-10-12 19:56:07,428 INFO L226 Difference]: Without dead ends: 12320 [2024-10-12 19:56:07,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:56:07,440 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 1262 mSDsluCounter, 1320 mSDsCounter, 0 mSdLazyCounter, 3045 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 3104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:07,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 1720 Invalid, 3104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3045 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 19:56:07,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12320 states. [2024-10-12 19:56:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12320 to 9357. [2024-10-12 19:56:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9357 states, 8494 states have (on average 1.5919472568872146) internal successors, (13522), 8527 states have internal predecessors, (13522), 632 states have call successors, (632), 198 states have call predecessors, (632), 230 states have return successors, (907), 663 states have call predecessors, (907), 632 states have call successors, (907) [2024-10-12 19:56:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9357 states to 9357 states and 15061 transitions. [2024-10-12 19:56:07,955 INFO L78 Accepts]: Start accepts. Automaton has 9357 states and 15061 transitions. Word has length 140 [2024-10-12 19:56:07,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:56:07,955 INFO L471 AbstractCegarLoop]: Abstraction has 9357 states and 15061 transitions. [2024-10-12 19:56:07,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 9357 states and 15061 transitions. [2024-10-12 19:56:07,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:56:07,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:56:07,967 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:56:07,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:56:07,968 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:56:07,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:56:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash 740149905, now seen corresponding path program 1 times [2024-10-12 19:56:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:56:07,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273813902] [2024-10-12 19:56:07,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:56:07,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:56:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:08,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:56:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:08,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:56:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:08,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:56:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:08,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:56:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:08,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:56:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:08,135 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-12 19:56:08,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:56:08,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273813902] [2024-10-12 19:56:08,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273813902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:56:08,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:56:08,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:56:08,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042303753] [2024-10-12 19:56:08,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:56:08,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:56:08,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:56:08,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:56:08,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:56:08,138 INFO L87 Difference]: Start difference. First operand 9357 states and 15061 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:11,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:11,648 INFO L93 Difference]: Finished difference Result 33419 states and 54575 transitions. [2024-10-12 19:56:11,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:56:11,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:56:11,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:11,715 INFO L225 Difference]: With dead ends: 33419 [2024-10-12 19:56:11,716 INFO L226 Difference]: Without dead ends: 24078 [2024-10-12 19:56:11,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:56:11,740 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 1348 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 2535 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:11,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 1124 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2535 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 19:56:11,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24078 states. [2024-10-12 19:56:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24078 to 18462. [2024-10-12 19:56:12,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18462 states, 16767 states have (on average 1.5900280312518638) internal successors, (26660), 16832 states have internal predecessors, (26660), 1240 states have call successors, (1240), 390 states have call predecessors, (1240), 454 states have return successors, (2033), 1303 states have call predecessors, (2033), 1240 states have call successors, (2033) [2024-10-12 19:56:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18462 states to 18462 states and 29933 transitions. [2024-10-12 19:56:12,748 INFO L78 Accepts]: Start accepts. Automaton has 18462 states and 29933 transitions. Word has length 140 [2024-10-12 19:56:12,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:56:12,749 INFO L471 AbstractCegarLoop]: Abstraction has 18462 states and 29933 transitions. [2024-10-12 19:56:12,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:12,749 INFO L276 IsEmpty]: Start isEmpty. Operand 18462 states and 29933 transitions. [2024-10-12 19:56:12,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:56:12,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:56:12,759 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:56:12,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:56:12,759 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:56:12,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:56:12,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1211506255, now seen corresponding path program 1 times [2024-10-12 19:56:12,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:56:12,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406886079] [2024-10-12 19:56:12,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:56:12,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:56:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:12,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:56:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:12,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:56:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:56:13,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:13,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:56:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:13,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:56:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:13,047 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-12 19:56:13,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:56:13,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406886079] [2024-10-12 19:56:13,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406886079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:56:13,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:56:13,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:56:13,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964949091] [2024-10-12 19:56:13,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:56:13,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:56:13,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:56:13,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:56:13,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:56:13,049 INFO L87 Difference]: Start difference. First operand 18462 states and 29933 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:18,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:18,793 INFO L93 Difference]: Finished difference Result 73432 states and 120723 transitions. [2024-10-12 19:56:18,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:56:18,794 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:56:18,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:18,974 INFO L225 Difference]: With dead ends: 73432 [2024-10-12 19:56:18,974 INFO L226 Difference]: Without dead ends: 54986 [2024-10-12 19:56:19,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:56:19,030 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 1344 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 3554 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1360 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 3615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:19,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1360 Valid, 1709 Invalid, 3615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3554 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 19:56:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54986 states. [2024-10-12 19:56:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54986 to 36352. [2024-10-12 19:56:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36352 states, 33057 states have (on average 1.5907069607042381) internal successors, (52584), 33186 states have internal predecessors, (52584), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 902 states have return successors, (4707), 2519 states have call predecessors, (4707), 2392 states have call successors, (4707) [2024-10-12 19:56:21,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36352 states to 36352 states and 59683 transitions. [2024-10-12 19:56:21,788 INFO L78 Accepts]: Start accepts. Automaton has 36352 states and 59683 transitions. Word has length 140 [2024-10-12 19:56:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:56:21,790 INFO L471 AbstractCegarLoop]: Abstraction has 36352 states and 59683 transitions. [2024-10-12 19:56:21,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand 36352 states and 59683 transitions. [2024-10-12 19:56:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:56:21,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:56:21,808 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:56:21,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:56:21,809 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:56:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:56:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash -919844467, now seen corresponding path program 1 times [2024-10-12 19:56:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:56:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791867743] [2024-10-12 19:56:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:56:21,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:56:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:21,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:56:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:21,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:56:21,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:21,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:56:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:21,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:56:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:21,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:56:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:21,958 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-12 19:56:21,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:56:21,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791867743] [2024-10-12 19:56:21,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791867743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:56:21,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:56:21,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:56:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854858994] [2024-10-12 19:56:21,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:56:21,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:56:21,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:56:21,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:56:21,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:56:21,960 INFO L87 Difference]: Start difference. First operand 36352 states and 59683 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:26,230 INFO L93 Difference]: Finished difference Result 83925 states and 140563 transitions. [2024-10-12 19:56:26,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:56:26,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:56:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:26,399 INFO L225 Difference]: With dead ends: 83925 [2024-10-12 19:56:26,399 INFO L226 Difference]: Without dead ends: 47589 [2024-10-12 19:56:26,606 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-12 19:56:26,607 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 926 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:26,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 881 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 19:56:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47589 states. [2024-10-12 19:56:28,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47589 to 36352. [2024-10-12 19:56:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36352 states, 33057 states have (on average 1.5868046102187132) internal successors, (52455), 33186 states have internal predecessors, (52455), 2392 states have call successors, (2392), 774 states have call predecessors, (2392), 902 states have return successors, (4707), 2519 states have call predecessors, (4707), 2392 states have call successors, (4707) [2024-10-12 19:56:28,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36352 states to 36352 states and 59554 transitions. [2024-10-12 19:56:28,735 INFO L78 Accepts]: Start accepts. Automaton has 36352 states and 59554 transitions. Word has length 140 [2024-10-12 19:56:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:56:28,735 INFO L471 AbstractCegarLoop]: Abstraction has 36352 states and 59554 transitions. [2024-10-12 19:56:28,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 36352 states and 59554 transitions. [2024-10-12 19:56:28,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:56:28,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:56:28,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:56:28,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:56:28,755 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:56:28,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:56:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1958429041, now seen corresponding path program 1 times [2024-10-12 19:56:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:56:28,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371607633] [2024-10-12 19:56:28,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:56:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:56:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:56:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:28,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:56:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:28,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:56:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:56:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:28,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:56:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:28,940 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-12 19:56:28,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:56:28,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371607633] [2024-10-12 19:56:28,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371607633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:56:28,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:56:28,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:56:28,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482284465] [2024-10-12 19:56:28,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:56:28,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:56:28,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:56:28,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:56:28,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:56:28,942 INFO L87 Difference]: Start difference. First operand 36352 states and 59554 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:36,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:36,974 INFO L93 Difference]: Finished difference Result 141686 states and 235155 transitions. [2024-10-12 19:56:36,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:56:36,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:56:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:37,278 INFO L225 Difference]: With dead ends: 141686 [2024-10-12 19:56:37,278 INFO L226 Difference]: Without dead ends: 105350 [2024-10-12 19:56:37,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:56:37,369 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 1513 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 2952 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:37,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 1713 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2952 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-12 19:56:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105350 states. [2024-10-12 19:56:41,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105350 to 72578. [2024-10-12 19:56:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72578 states, 66147 states have (on average 1.5864513885739338) internal successors, (104939), 66404 states have internal predecessors, (104939), 4632 states have call successors, (4632), 1542 states have call predecessors, (4632), 1798 states have return successors, (11449), 4887 states have call predecessors, (11449), 4632 states have call successors, (11449) [2024-10-12 19:56:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72578 states to 72578 states and 121020 transitions. [2024-10-12 19:56:42,290 INFO L78 Accepts]: Start accepts. Automaton has 72578 states and 121020 transitions. Word has length 140 [2024-10-12 19:56:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:56:42,290 INFO L471 AbstractCegarLoop]: Abstraction has 72578 states and 121020 transitions. [2024-10-12 19:56:42,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 72578 states and 121020 transitions. [2024-10-12 19:56:42,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-12 19:56:42,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:56:42,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 19:56:42,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:56:42,327 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:56:42,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:56:42,328 INFO L85 PathProgramCache]: Analyzing trace with hash 363372877, now seen corresponding path program 1 times [2024-10-12 19:56:42,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:56:42,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97391236] [2024-10-12 19:56:42,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:56:42,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:56:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:42,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:56:42,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:42,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:56:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:56:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:42,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:56:42,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:56:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:56:42,573 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-12 19:56:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:56:42,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97391236] [2024-10-12 19:56:42,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97391236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:56:42,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:56:42,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:56:42,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427284659] [2024-10-12 19:56:42,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:56:42,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:56:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:56:42,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:56:42,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:56:42,576 INFO L87 Difference]: Start difference. First operand 72578 states and 121020 transitions. Second operand has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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-12 19:56:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:56:57,313 INFO L93 Difference]: Finished difference Result 278902 states and 471275 transitions. [2024-10-12 19:56:57,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 19:56:57,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.571428571428573) internal successors, (130), 5 states have internal predecessors, (130), 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 140 [2024-10-12 19:56:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:56:58,456 INFO L225 Difference]: With dead ends: 278902 [2024-10-12 19:56:58,457 INFO L226 Difference]: Without dead ends: 206340 [2024-10-12 19:56:58,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:56:58,644 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 1309 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 3366 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:56:58,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 1713 Invalid, 3427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3366 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-12 19:56:58,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206340 states.