./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.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 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:32:39,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:32:39,180 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:32:39,186 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:32:39,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:32:39,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:32:39,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:32:39,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:32:39,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:32:39,209 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:32:39,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:32:39,209 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:32:39,210 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:32:39,210 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:32:39,211 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:32:39,211 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:32:39,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:32:39,212 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:32:39,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:32:39,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:32:39,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:32:39,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:32:39,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:32:39,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:32:39,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:32:39,215 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:32:39,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:32:39,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:32:39,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:32:39,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:32:39,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:32:39,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:32:39,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:32:39,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:32:39,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:32:39,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:32:39,219 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:32:39,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:32:39,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:32:39,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:32:39,221 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:32:39,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:32:39,222 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 -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2024-11-08 15:32:39,486 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:32:39,517 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:32:39,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:32:39,522 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:32:39,523 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:32:39,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-08 15:32:41,047 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:32:41,275 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:32:41,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-08 15:32:41,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6202e547/e5b6f6d9ec60499193e8b3e815b88c61/FLAG443bcc407 [2024-11-08 15:32:41,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6202e547/e5b6f6d9ec60499193e8b3e815b88c61 [2024-11-08 15:32:41,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:32:41,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:32:41,626 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:32:41,626 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:32:41,631 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:32:41,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:32:41" (1/1) ... [2024-11-08 15:32:41,632 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f19d508 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:41, skipping insertion in model container [2024-11-08 15:32:41,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:32:41" (1/1) ... [2024-11-08 15:32:41,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:32:42,003 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2024-11-08 15:32:42,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:32:42,019 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:32:42,087 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2024-11-08 15:32:42,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:32:42,112 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:32:42,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42 WrapperNode [2024-11-08 15:32:42,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:32:42,114 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:32:42,114 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:32:42,114 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:32:42,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,144 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,184 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 419 [2024-11-08 15:32:42,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:32:42,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:32:42,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:32:42,189 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:32:42,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,204 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,231 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-08 15:32:42,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:32:42,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:32:42,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:32:42,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:32:42,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (1/1) ... [2024-11-08 15:32:42,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:32:42,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:42,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 15:32:42,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 15:32:42,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:32:42,374 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-08 15:32:42,375 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-08 15:32:42,375 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-08 15:32:42,375 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-08 15:32:42,375 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-08 15:32:42,376 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-08 15:32:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-08 15:32:42,376 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-08 15:32:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-08 15:32:42,376 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-08 15:32:42,376 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 15:32:42,378 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 15:32:42,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:32:42,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:32:42,378 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:32:42,492 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:32:42,494 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:32:43,076 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-11-08 15:32:43,077 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:32:43,098 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:32:43,099 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 15:32:43,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:32:43 BoogieIcfgContainer [2024-11-08 15:32:43,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:32:43,103 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:32:43,103 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:32:43,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:32:43,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:32:41" (1/3) ... [2024-11-08 15:32:43,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776afdc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:32:43, skipping insertion in model container [2024-11-08 15:32:43,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:32:42" (2/3) ... [2024-11-08 15:32:43,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@776afdc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:32:43, skipping insertion in model container [2024-11-08 15:32:43,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:32:43" (3/3) ... [2024-11-08 15:32:43,111 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-08 15:32:43,134 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:32:43,134 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:32:43,213 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:32:43,222 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;@52672126, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:32:43,222 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:32:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 133 states have (on average 1.586466165413534) internal successors, (211), 138 states have internal predecessors, (211), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 15:32:43,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 15:32:43,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:43,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:43,247 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:43,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:43,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2086312570, now seen corresponding path program 1 times [2024-11-08 15:32:43,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:43,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845299920] [2024-11-08 15:32:43,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:43,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:43,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:43,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:43,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845299920] [2024-11-08 15:32:43,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845299920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:43,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:43,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:43,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068644935] [2024-11-08 15:32:43,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:43,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:43,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:43,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:43,763 INFO L87 Difference]: Start difference. First operand has 178 states, 133 states have (on average 1.586466165413534) internal successors, (211), 138 states have internal predecessors, (211), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:32:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:43,898 INFO L93 Difference]: Finished difference Result 355 states and 608 transitions. [2024-11-08 15:32:43,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:43,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-08 15:32:43,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:43,922 INFO L225 Difference]: With dead ends: 355 [2024-11-08 15:32:43,922 INFO L226 Difference]: Without dead ends: 180 [2024-11-08 15:32:43,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:43,932 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 7 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:43,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 803 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:43,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-08 15:32:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-08 15:32:43,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.5555555555555556) internal successors, (210), 139 states have internal predecessors, (210), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 15:32:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 284 transitions. [2024-11-08 15:32:43,999 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 284 transitions. Word has length 15 [2024-11-08 15:32:44,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:44,000 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 284 transitions. [2024-11-08 15:32:44,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:32:44,001 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 284 transitions. [2024-11-08 15:32:44,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-08 15:32:44,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:44,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:44,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:32:44,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:44,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:44,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2089918424, now seen corresponding path program 1 times [2024-11-08 15:32:44,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:44,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143997682] [2024-11-08 15:32:44,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:44,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:44,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:44,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-11-08 15:32:44,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:44,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143997682] [2024-11-08 15:32:44,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143997682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:44,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:44,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:44,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087656082] [2024-11-08 15:32:44,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:44,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:44,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:44,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:44,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:44,141 INFO L87 Difference]: Start difference. First operand 180 states and 284 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:32:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:44,231 INFO L93 Difference]: Finished difference Result 373 states and 591 transitions. [2024-11-08 15:32:44,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:44,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-08 15:32:44,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:44,235 INFO L225 Difference]: With dead ends: 373 [2024-11-08 15:32:44,235 INFO L226 Difference]: Without dead ends: 196 [2024-11-08 15:32:44,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:44,238 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 25 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:44,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 819 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-08 15:32:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-11-08 15:32:44,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 150 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 15:32:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2024-11-08 15:32:44,258 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 16 [2024-11-08 15:32:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:44,259 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2024-11-08 15:32:44,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:32:44,259 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2024-11-08 15:32:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 15:32:44,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:44,261 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:44,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:32:44,261 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:44,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:44,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2079657108, now seen corresponding path program 1 times [2024-11-08 15:32:44,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:44,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900166822] [2024-11-08 15:32:44,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:44,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:44,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:44,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:44,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900166822] [2024-11-08 15:32:44,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900166822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:44,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:44,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:32:44,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430081883] [2024-11-08 15:32:44,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:44,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:32:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:44,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:32:44,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:32:44,420 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:32:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:44,463 INFO L93 Difference]: Finished difference Result 405 states and 637 transitions. [2024-11-08 15:32:44,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:32:44,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-08 15:32:44,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:44,470 INFO L225 Difference]: With dead ends: 405 [2024-11-08 15:32:44,471 INFO L226 Difference]: Without dead ends: 222 [2024-11-08 15:32:44,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:32:44,473 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 22 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:44,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 550 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:44,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-08 15:32:44,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 195. [2024-11-08 15:32:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.527027027027027) internal successors, (226), 152 states have internal predecessors, (226), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 15:32:44,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 302 transitions. [2024-11-08 15:32:44,496 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 302 transitions. Word has length 24 [2024-11-08 15:32:44,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:44,497 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 302 transitions. [2024-11-08 15:32:44,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-08 15:32:44,497 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 302 transitions. [2024-11-08 15:32:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 15:32:44,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:44,499 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:44,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:32:44,499 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:44,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:44,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1546063421, now seen corresponding path program 1 times [2024-11-08 15:32:44,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:44,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377182578] [2024-11-08 15:32:44,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:44,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:44,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:44,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:44,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:44,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377182578] [2024-11-08 15:32:44,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377182578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:44,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:44,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:32:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576632004] [2024-11-08 15:32:44,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:44,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:32:44,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:44,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:32:44,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:44,669 INFO L87 Difference]: Start difference. First operand 195 states and 302 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:32:44,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:44,725 INFO L93 Difference]: Finished difference Result 380 states and 593 transitions. [2024-11-08 15:32:44,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:44,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-08 15:32:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:44,728 INFO L225 Difference]: With dead ends: 380 [2024-11-08 15:32:44,728 INFO L226 Difference]: Without dead ends: 201 [2024-11-08 15:32:44,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:44,732 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 0 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:44,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1094 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-08 15:32:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2024-11-08 15:32:44,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 155 states have internal predecessors, (229), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2024-11-08 15:32:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 306 transitions. [2024-11-08 15:32:44,763 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 306 transitions. Word has length 32 [2024-11-08 15:32:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:44,763 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 306 transitions. [2024-11-08 15:32:44,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:32:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 306 transitions. [2024-11-08 15:32:44,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 15:32:44,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:44,767 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] [2024-11-08 15:32:44,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:32:44,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:44,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1069273240, now seen corresponding path program 1 times [2024-11-08 15:32:44,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:44,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710676015] [2024-11-08 15:32:44,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:44,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:44,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:44,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:44,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-08 15:32:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:44,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:44,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710676015] [2024-11-08 15:32:44,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710676015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:44,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:44,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:32:44,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683801596] [2024-11-08 15:32:44,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:44,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:32:44,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:44,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:32:44,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:32:44,923 INFO L87 Difference]: Start difference. First operand 199 states and 306 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:32:45,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:45,016 INFO L93 Difference]: Finished difference Result 343 states and 534 transitions. [2024-11-08 15:32:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:32:45,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-08 15:32:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:45,019 INFO L225 Difference]: With dead ends: 343 [2024-11-08 15:32:45,019 INFO L226 Difference]: Without dead ends: 195 [2024-11-08 15:32:45,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:32:45,024 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:45,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1330 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:45,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-08 15:32:45,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-08 15:32:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 152 states have internal predecessors, (221), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-08 15:32:45,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 297 transitions. [2024-11-08 15:32:45,053 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 297 transitions. Word has length 35 [2024-11-08 15:32:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:45,054 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 297 transitions. [2024-11-08 15:32:45,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-08 15:32:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 297 transitions. [2024-11-08 15:32:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 15:32:45,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:45,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:45,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:32:45,056 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:45,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:45,057 INFO L85 PathProgramCache]: Analyzing trace with hash -32659331, now seen corresponding path program 1 times [2024-11-08 15:32:45,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:45,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776008459] [2024-11-08 15:32:45,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:45,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:45,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:45,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776008459] [2024-11-08 15:32:45,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776008459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:45,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849242741] [2024-11-08 15:32:45,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:45,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:45,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:45,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:45,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 15:32:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 15:32:45,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:45,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:45,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:32:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:32:45,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849242741] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:32:45,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:32:45,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-08 15:32:45,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207952454] [2024-11-08 15:32:45,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:32:45,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:32:45,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:45,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:32:45,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:45,418 INFO L87 Difference]: Start difference. First operand 195 states and 297 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:45,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:45,470 INFO L93 Difference]: Finished difference Result 438 states and 681 transitions. [2024-11-08 15:32:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:45,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-08 15:32:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:45,474 INFO L225 Difference]: With dead ends: 438 [2024-11-08 15:32:45,476 INFO L226 Difference]: Without dead ends: 254 [2024-11-08 15:32:45,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:45,478 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 58 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:45,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1052 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:45,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-08 15:32:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2024-11-08 15:32:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 191 states have (on average 1.4659685863874345) internal successors, (280), 195 states have internal predecessors, (280), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-08 15:32:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 376 transitions. [2024-11-08 15:32:45,499 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 376 transitions. Word has length 35 [2024-11-08 15:32:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:45,499 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 376 transitions. [2024-11-08 15:32:45,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-08 15:32:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 376 transitions. [2024-11-08 15:32:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 15:32:45,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:45,501 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:45,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:32:45,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 15:32:45,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:45,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1003259933, now seen corresponding path program 2 times [2024-11-08 15:32:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:45,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159786643] [2024-11-08 15:32:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:45,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-08 15:32:45,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:45,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159786643] [2024-11-08 15:32:45,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159786643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:45,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:45,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:45,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937886268] [2024-11-08 15:32:45,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:45,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:45,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:45,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:45,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:45,820 INFO L87 Difference]: Start difference. First operand 248 states and 376 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:32:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:45,870 INFO L93 Difference]: Finished difference Result 506 states and 778 transitions. [2024-11-08 15:32:45,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:45,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-08 15:32:45,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:45,874 INFO L225 Difference]: With dead ends: 506 [2024-11-08 15:32:45,875 INFO L226 Difference]: Without dead ends: 287 [2024-11-08 15:32:45,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:45,877 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 24 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:45,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 811 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-08 15:32:45,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2024-11-08 15:32:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 223 states have (on average 1.4215246636771302) internal successors, (317), 227 states have internal predecessors, (317), 51 states have call successors, (51), 9 states have call predecessors, (51), 9 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 15:32:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 419 transitions. [2024-11-08 15:32:45,897 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 419 transitions. Word has length 57 [2024-11-08 15:32:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:45,898 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 419 transitions. [2024-11-08 15:32:45,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:32:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 419 transitions. [2024-11-08 15:32:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-08 15:32:45,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:45,900 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:45,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:32:45,900 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:45,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash -447415154, now seen corresponding path program 1 times [2024-11-08 15:32:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:45,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716270284] [2024-11-08 15:32:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:45,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-08 15:32:45,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:45,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716270284] [2024-11-08 15:32:45,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716270284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:45,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:45,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:45,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818795759] [2024-11-08 15:32:45,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:45,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:45,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:45,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:45,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:45,995 INFO L87 Difference]: Start difference. First operand 284 states and 419 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:32:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:46,048 INFO L93 Difference]: Finished difference Result 541 states and 819 transitions. [2024-11-08 15:32:46,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:46,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-08 15:32:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:46,052 INFO L225 Difference]: With dead ends: 541 [2024-11-08 15:32:46,053 INFO L226 Difference]: Without dead ends: 291 [2024-11-08 15:32:46,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:46,055 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 8 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:46,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 793 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:46,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-08 15:32:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-08 15:32:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 229 states have (on average 1.4192139737991267) internal successors, (325), 233 states have internal predecessors, (325), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 15:32:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 427 transitions. [2024-11-08 15:32:46,075 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 427 transitions. Word has length 57 [2024-11-08 15:32:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:46,076 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 427 transitions. [2024-11-08 15:32:46,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-08 15:32:46,077 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 427 transitions. [2024-11-08 15:32:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-08 15:32:46,078 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:46,078 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:46,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:32:46,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:46,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:46,079 INFO L85 PathProgramCache]: Analyzing trace with hash 879511853, now seen corresponding path program 1 times [2024-11-08 15:32:46,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:46,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633789506] [2024-11-08 15:32:46,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:46,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:46,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:46,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-08 15:32:46,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:46,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633789506] [2024-11-08 15:32:46,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633789506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:46,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:46,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:32:46,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667992316] [2024-11-08 15:32:46,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:46,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:32:46,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:46,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:32:46,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:46,241 INFO L87 Difference]: Start difference. First operand 291 states and 427 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 15:32:46,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:46,275 INFO L93 Difference]: Finished difference Result 531 states and 793 transitions. [2024-11-08 15:32:46,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:46,276 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2024-11-08 15:32:46,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:46,278 INFO L225 Difference]: With dead ends: 531 [2024-11-08 15:32:46,278 INFO L226 Difference]: Without dead ends: 293 [2024-11-08 15:32:46,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:46,282 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:46,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1081 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-08 15:32:46,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2024-11-08 15:32:46,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 229 states have (on average 1.4061135371179039) internal successors, (322), 233 states have internal predecessors, (322), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 15:32:46,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 424 transitions. [2024-11-08 15:32:46,302 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 424 transitions. Word has length 75 [2024-11-08 15:32:46,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:46,302 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 424 transitions. [2024-11-08 15:32:46,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 15:32:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 424 transitions. [2024-11-08 15:32:46,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 15:32:46,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:46,304 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:46,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:32:46,304 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:46,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:46,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1733898963, now seen corresponding path program 1 times [2024-11-08 15:32:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:46,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546267165] [2024-11-08 15:32:46,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:46,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:46,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,460 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-08 15:32:46,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:46,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546267165] [2024-11-08 15:32:46,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546267165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:46,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:46,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:46,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856159873] [2024-11-08 15:32:46,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:46,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:46,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:46,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:46,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:46,462 INFO L87 Difference]: Start difference. First operand 291 states and 424 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 15:32:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:46,524 INFO L93 Difference]: Finished difference Result 568 states and 849 transitions. [2024-11-08 15:32:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:46,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-11-08 15:32:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:46,527 INFO L225 Difference]: With dead ends: 568 [2024-11-08 15:32:46,527 INFO L226 Difference]: Without dead ends: 335 [2024-11-08 15:32:46,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:46,529 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 25 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:46,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 811 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:46,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-08 15:32:46,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2024-11-08 15:32:46,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 266 states have (on average 1.368421052631579) internal successors, (364), 270 states have internal predecessors, (364), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 15:32:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 472 transitions. [2024-11-08 15:32:46,545 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 472 transitions. Word has length 104 [2024-11-08 15:32:46,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:46,546 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 472 transitions. [2024-11-08 15:32:46,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 15:32:46,546 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 472 transitions. [2024-11-08 15:32:46,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-08 15:32:46,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:46,547 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:46,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:32:46,548 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:46,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:46,548 INFO L85 PathProgramCache]: Analyzing trace with hash -8134044, now seen corresponding path program 1 times [2024-11-08 15:32:46,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:46,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362007389] [2024-11-08 15:32:46,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:46,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-08 15:32:46,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:46,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362007389] [2024-11-08 15:32:46,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362007389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:46,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:46,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:46,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235501856] [2024-11-08 15:32:46,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:46,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:46,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:46,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:46,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:46,674 INFO L87 Difference]: Start difference. First operand 332 states and 472 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 15:32:46,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:46,730 INFO L93 Difference]: Finished difference Result 594 states and 869 transitions. [2024-11-08 15:32:46,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:46,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2024-11-08 15:32:46,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:46,733 INFO L225 Difference]: With dead ends: 594 [2024-11-08 15:32:46,734 INFO L226 Difference]: Without dead ends: 326 [2024-11-08 15:32:46,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:46,736 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 9 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:46,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 776 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-08 15:32:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-08 15:32:46,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 261 states have (on average 1.3486590038314177) internal successors, (352), 265 states have internal predecessors, (352), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-08 15:32:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 458 transitions. [2024-11-08 15:32:46,755 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 458 transitions. Word has length 105 [2024-11-08 15:32:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:46,755 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 458 transitions. [2024-11-08 15:32:46,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-08 15:32:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 458 transitions. [2024-11-08 15:32:46,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 15:32:46,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:46,757 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:46,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:32:46,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:46,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:46,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1589641163, now seen corresponding path program 1 times [2024-11-08 15:32:46,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:46,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966121835] [2024-11-08 15:32:46,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:46,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-08 15:32:46,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:46,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966121835] [2024-11-08 15:32:46,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966121835] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:46,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:46,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:32:46,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870042367] [2024-11-08 15:32:46,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:46,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:32:46,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:46,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:32:46,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:46,930 INFO L87 Difference]: Start difference. First operand 326 states and 458 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 15:32:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:46,965 INFO L93 Difference]: Finished difference Result 569 states and 818 transitions. [2024-11-08 15:32:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:46,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2024-11-08 15:32:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:46,969 INFO L225 Difference]: With dead ends: 569 [2024-11-08 15:32:46,969 INFO L226 Difference]: Without dead ends: 328 [2024-11-08 15:32:46,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:46,971 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:46,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1065 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:46,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-08 15:32:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2024-11-08 15:32:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 261 states have (on average 1.3371647509578544) internal successors, (349), 265 states have internal predecessors, (349), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-08 15:32:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 455 transitions. [2024-11-08 15:32:46,987 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 455 transitions. Word has length 124 [2024-11-08 15:32:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:46,988 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 455 transitions. [2024-11-08 15:32:46,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 15:32:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 455 transitions. [2024-11-08 15:32:46,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-08 15:32:46,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:46,991 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:46,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:32:46,992 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:46,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:46,993 INFO L85 PathProgramCache]: Analyzing trace with hash -164352821, now seen corresponding path program 1 times [2024-11-08 15:32:46,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:46,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333530651] [2024-11-08 15:32:46,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:46,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:47,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:47,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-08 15:32:47,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:47,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333530651] [2024-11-08 15:32:47,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333530651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:47,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:47,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:47,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995873070] [2024-11-08 15:32:47,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:47,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:47,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:47,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:47,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:47,188 INFO L87 Difference]: Start difference. First operand 326 states and 455 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 15:32:47,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:47,247 INFO L93 Difference]: Finished difference Result 532 states and 778 transitions. [2024-11-08 15:32:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:47,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2024-11-08 15:32:47,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:47,250 INFO L225 Difference]: With dead ends: 532 [2024-11-08 15:32:47,250 INFO L226 Difference]: Without dead ends: 324 [2024-11-08 15:32:47,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:47,252 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 7 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:47,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 744 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-08 15:32:47,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-11-08 15:32:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 260 states have (on average 1.3346153846153845) internal successors, (347), 264 states have internal predecessors, (347), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-08 15:32:47,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 451 transitions. [2024-11-08 15:32:47,269 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 451 transitions. Word has length 157 [2024-11-08 15:32:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:47,270 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 451 transitions. [2024-11-08 15:32:47,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-08 15:32:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 451 transitions. [2024-11-08 15:32:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-08 15:32:47,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:47,272 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:47,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:32:47,273 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:47,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1524827283, now seen corresponding path program 1 times [2024-11-08 15:32:47,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:47,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723588934] [2024-11-08 15:32:47,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:47,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:47,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-08 15:32:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,470 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-08 15:32:47,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:47,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723588934] [2024-11-08 15:32:47,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723588934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:47,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:47,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:47,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943663552] [2024-11-08 15:32:47,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:47,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:47,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:47,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:47,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:47,472 INFO L87 Difference]: Start difference. First operand 324 states and 451 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 15:32:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:47,544 INFO L93 Difference]: Finished difference Result 472 states and 674 transitions. [2024-11-08 15:32:47,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:47,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 176 [2024-11-08 15:32:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:47,547 INFO L225 Difference]: With dead ends: 472 [2024-11-08 15:32:47,548 INFO L226 Difference]: Without dead ends: 307 [2024-11-08 15:32:47,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:47,549 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 35 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:47,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 720 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-08 15:32:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-08 15:32:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 250 states have internal predecessors, (326), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-08 15:32:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 424 transitions. [2024-11-08 15:32:47,583 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 424 transitions. Word has length 176 [2024-11-08 15:32:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:47,584 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 424 transitions. [2024-11-08 15:32:47,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 15:32:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2024-11-08 15:32:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-08 15:32:47,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:47,586 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:47,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:32:47,586 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:47,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:47,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1721529288, now seen corresponding path program 1 times [2024-11-08 15:32:47,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:47,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966895858] [2024-11-08 15:32:47,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:47,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-08 15:32:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,779 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-11-08 15:32:47,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:47,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966895858] [2024-11-08 15:32:47,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966895858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:47,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:47,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:47,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351386837] [2024-11-08 15:32:47,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:47,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:47,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:47,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:47,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:47,785 INFO L87 Difference]: Start difference. First operand 307 states and 424 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 15:32:47,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:47,842 INFO L93 Difference]: Finished difference Result 455 states and 647 transitions. [2024-11-08 15:32:47,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:47,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 178 [2024-11-08 15:32:47,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:47,845 INFO L225 Difference]: With dead ends: 455 [2024-11-08 15:32:47,845 INFO L226 Difference]: Without dead ends: 288 [2024-11-08 15:32:47,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:47,848 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 30 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:47,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 724 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:47,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-08 15:32:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-08 15:32:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 230 states have (on average 1.317391304347826) internal successors, (303), 234 states have internal predecessors, (303), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 15:32:47,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 395 transitions. [2024-11-08 15:32:47,862 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 395 transitions. Word has length 178 [2024-11-08 15:32:47,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:47,863 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 395 transitions. [2024-11-08 15:32:47,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-08 15:32:47,863 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 395 transitions. [2024-11-08 15:32:47,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 15:32:47,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:47,865 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:47,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:32:47,865 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:47,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:47,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1770335087, now seen corresponding path program 1 times [2024-11-08 15:32:47,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:47,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549402460] [2024-11-08 15:32:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:47,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:47,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:48,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-08 15:32:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-08 15:32:48,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:48,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549402460] [2024-11-08 15:32:48,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549402460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:48,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:48,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:32:48,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390618059] [2024-11-08 15:32:48,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:48,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:32:48,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:48,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:32:48,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:48,084 INFO L87 Difference]: Start difference. First operand 288 states and 395 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 15:32:48,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:48,117 INFO L93 Difference]: Finished difference Result 435 states and 617 transitions. [2024-11-08 15:32:48,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:48,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 179 [2024-11-08 15:32:48,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:48,121 INFO L225 Difference]: With dead ends: 435 [2024-11-08 15:32:48,121 INFO L226 Difference]: Without dead ends: 288 [2024-11-08 15:32:48,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:48,122 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:48,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1043 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:48,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-08 15:32:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-08 15:32:48,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 230 states have (on average 1.291304347826087) internal successors, (297), 234 states have internal predecessors, (297), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-08 15:32:48,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 389 transitions. [2024-11-08 15:32:48,137 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 389 transitions. Word has length 179 [2024-11-08 15:32:48,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:48,137 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 389 transitions. [2024-11-08 15:32:48,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-08 15:32:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 389 transitions. [2024-11-08 15:32:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 15:32:48,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:48,140 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:48,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:32:48,140 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:48,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:48,141 INFO L85 PathProgramCache]: Analyzing trace with hash -984884076, now seen corresponding path program 1 times [2024-11-08 15:32:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:48,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522497758] [2024-11-08 15:32:48,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:48,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:48,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:48,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-08 15:32:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,294 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-08 15:32:48,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522497758] [2024-11-08 15:32:48,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522497758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:48,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678684173] [2024-11-08 15:32:48,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:48,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:48,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:48,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:48,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 15:32:48,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:48,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 15:32:48,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-08 15:32:48,533 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:32:48,688 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-08 15:32:48,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678684173] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:48,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 15:32:48,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2024-11-08 15:32:48,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148785635] [2024-11-08 15:32:48,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:48,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:48,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:48,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:48,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:48,690 INFO L87 Difference]: Start difference. First operand 288 states and 389 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:48,743 INFO L93 Difference]: Finished difference Result 456 states and 639 transitions. [2024-11-08 15:32:48,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:48,744 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 186 [2024-11-08 15:32:48,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:48,746 INFO L225 Difference]: With dead ends: 456 [2024-11-08 15:32:48,746 INFO L226 Difference]: Without dead ends: 267 [2024-11-08 15:32:48,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:48,747 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 20 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:48,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 723 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-08 15:32:48,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-08 15:32:48,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.2830188679245282) internal successors, (272), 216 states have internal predecessors, (272), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-08 15:32:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 358 transitions. [2024-11-08 15:32:48,760 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 358 transitions. Word has length 186 [2024-11-08 15:32:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:48,761 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 358 transitions. [2024-11-08 15:32:48,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-08 15:32:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 358 transitions. [2024-11-08 15:32:48,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-08 15:32:48,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:48,763 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:48,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 15:32:48,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 15:32:48,968 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:48,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1901722937, now seen corresponding path program 1 times [2024-11-08 15:32:48,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:48,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030973369] [2024-11-08 15:32:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:48,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:49,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:49,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:49,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:49,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:49,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,130 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-08 15:32:49,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:49,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030973369] [2024-11-08 15:32:49,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030973369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:49,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:49,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94554083] [2024-11-08 15:32:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:49,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:49,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:49,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:49,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:49,132 INFO L87 Difference]: Start difference. First operand 267 states and 358 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 15:32:49,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:49,165 INFO L93 Difference]: Finished difference Result 411 states and 577 transitions. [2024-11-08 15:32:49,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:49,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 210 [2024-11-08 15:32:49,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:49,168 INFO L225 Difference]: With dead ends: 411 [2024-11-08 15:32:49,168 INFO L226 Difference]: Without dead ends: 271 [2024-11-08 15:32:49,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:49,169 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 3 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:49,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 764 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-08 15:32:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-11-08 15:32:49,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 215 states have (on average 1.2790697674418605) internal successors, (275), 219 states have internal predecessors, (275), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-08 15:32:49,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 361 transitions. [2024-11-08 15:32:49,182 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 361 transitions. Word has length 210 [2024-11-08 15:32:49,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:49,184 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 361 transitions. [2024-11-08 15:32:49,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-08 15:32:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 361 transitions. [2024-11-08 15:32:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-08 15:32:49,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:49,188 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:49,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:32:49,188 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:49,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:49,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2012455842, now seen corresponding path program 1 times [2024-11-08 15:32:49,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:49,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930995735] [2024-11-08 15:32:49,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:49,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:49,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:49,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:32:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-08 15:32:49,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:49,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930995735] [2024-11-08 15:32:49,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930995735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:49,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110320144] [2024-11-08 15:32:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:49,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:49,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:49,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:49,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 15:32:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:49,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 15:32:49,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:49,609 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-08 15:32:49,609 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:32:49,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110320144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:49,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:32:49,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-08 15:32:49,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850032631] [2024-11-08 15:32:49,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:49,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:49,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:49,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:49,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:49,613 INFO L87 Difference]: Start difference. First operand 271 states and 361 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 15:32:49,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:49,650 INFO L93 Difference]: Finished difference Result 420 states and 585 transitions. [2024-11-08 15:32:49,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:49,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 217 [2024-11-08 15:32:49,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:49,655 INFO L225 Difference]: With dead ends: 420 [2024-11-08 15:32:49,655 INFO L226 Difference]: Without dead ends: 276 [2024-11-08 15:32:49,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:32:49,656 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:49,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 766 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-08 15:32:49,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-08 15:32:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 219 states have (on average 1.273972602739726) internal successors, (279), 223 states have internal predecessors, (279), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-08 15:32:49,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 365 transitions. [2024-11-08 15:32:49,670 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 365 transitions. Word has length 217 [2024-11-08 15:32:49,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:49,670 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 365 transitions. [2024-11-08 15:32:49,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-08 15:32:49,670 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 365 transitions. [2024-11-08 15:32:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-08 15:32:49,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:49,672 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:49,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 15:32:49,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:49,873 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:49,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:49,874 INFO L85 PathProgramCache]: Analyzing trace with hash -323224646, now seen corresponding path program 1 times [2024-11-08 15:32:49,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:49,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070465966] [2024-11-08 15:32:49,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:49,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:50,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:32:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:32:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-08 15:32:50,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:50,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070465966] [2024-11-08 15:32:50,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070465966] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:50,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57783805] [2024-11-08 15:32:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:50,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:50,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:50,128 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:50,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 15:32:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 15:32:50,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:50,352 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-08 15:32:50,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:32:50,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57783805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:50,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:32:50,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-08 15:32:50,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644559630] [2024-11-08 15:32:50,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:50,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:50,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:50,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:50,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:50,355 INFO L87 Difference]: Start difference. First operand 276 states and 365 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 15:32:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:50,392 INFO L93 Difference]: Finished difference Result 424 states and 585 transitions. [2024-11-08 15:32:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:50,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 225 [2024-11-08 15:32:50,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:50,395 INFO L225 Difference]: With dead ends: 424 [2024-11-08 15:32:50,395 INFO L226 Difference]: Without dead ends: 275 [2024-11-08 15:32:50,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:32:50,396 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 5 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:50,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 756 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:50,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-08 15:32:50,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-08 15:32:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 219 states have (on average 1.2602739726027397) internal successors, (276), 222 states have internal predecessors, (276), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-08 15:32:50,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 360 transitions. [2024-11-08 15:32:50,410 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 360 transitions. Word has length 225 [2024-11-08 15:32:50,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:50,410 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 360 transitions. [2024-11-08 15:32:50,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-08 15:32:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 360 transitions. [2024-11-08 15:32:50,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-08 15:32:50,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:50,413 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:50,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 15:32:50,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:50,614 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:50,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:50,614 INFO L85 PathProgramCache]: Analyzing trace with hash -270122890, now seen corresponding path program 1 times [2024-11-08 15:32:50,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:50,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887308191] [2024-11-08 15:32:50,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:50,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:50,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:50,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:50,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:32:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:32:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:32:50,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:50,835 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-08 15:32:50,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:50,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887308191] [2024-11-08 15:32:50,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887308191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:50,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:50,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914986305] [2024-11-08 15:32:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:50,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:50,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:50,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:50,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:50,838 INFO L87 Difference]: Start difference. First operand 275 states and 360 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 15:32:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:51,136 INFO L93 Difference]: Finished difference Result 422 states and 574 transitions. [2024-11-08 15:32:51,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:32:51,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 232 [2024-11-08 15:32:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:51,140 INFO L225 Difference]: With dead ends: 422 [2024-11-08 15:32:51,140 INFO L226 Difference]: Without dead ends: 274 [2024-11-08 15:32:51,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:51,142 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 62 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:51,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 473 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:32:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-08 15:32:51,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-08 15:32:51,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 219 states have (on average 1.2557077625570776) internal successors, (275), 221 states have internal predecessors, (275), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-08 15:32:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 357 transitions. [2024-11-08 15:32:51,164 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 357 transitions. Word has length 232 [2024-11-08 15:32:51,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:51,164 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 357 transitions. [2024-11-08 15:32:51,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 15:32:51,164 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 357 transitions. [2024-11-08 15:32:51,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-08 15:32:51,166 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:51,167 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:51,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 15:32:51,167 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:51,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:51,167 INFO L85 PathProgramCache]: Analyzing trace with hash 28448745, now seen corresponding path program 1 times [2024-11-08 15:32:51,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:51,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397516731] [2024-11-08 15:32:51,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:51,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:51,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:51,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:51,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:51,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:51,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:32:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:32:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:32:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-08 15:32:51,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:51,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397516731] [2024-11-08 15:32:51,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397516731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:51,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:51,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:32:51,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626653350] [2024-11-08 15:32:51,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:51,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:32:51,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:51,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:32:51,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:51,519 INFO L87 Difference]: Start difference. First operand 274 states and 357 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 15:32:52,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:52,093 INFO L93 Difference]: Finished difference Result 634 states and 855 transitions. [2024-11-08 15:32:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:32:52,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 235 [2024-11-08 15:32:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:52,097 INFO L225 Difference]: With dead ends: 634 [2024-11-08 15:32:52,098 INFO L226 Difference]: Without dead ends: 487 [2024-11-08 15:32:52,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:32:52,099 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 421 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:52,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 621 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:32:52,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-08 15:32:52,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2024-11-08 15:32:52,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 379 states have (on average 1.3087071240105541) internal successors, (496), 381 states have internal predecessors, (496), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-08 15:32:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 636 transitions. [2024-11-08 15:32:52,134 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 636 transitions. Word has length 235 [2024-11-08 15:32:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:52,135 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 636 transitions. [2024-11-08 15:32:52,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 15:32:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 636 transitions. [2024-11-08 15:32:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-08 15:32:52,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:52,138 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:52,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 15:32:52,138 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:52,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:52,139 INFO L85 PathProgramCache]: Analyzing trace with hash 443330850, now seen corresponding path program 1 times [2024-11-08 15:32:52,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:52,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998986501] [2024-11-08 15:32:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:52,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:52,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:32:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:32:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:32:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-08 15:32:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-08 15:32:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-08 15:32:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-08 15:32:52,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-08 15:32:52,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:52,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998986501] [2024-11-08 15:32:52,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998986501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:52,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:52,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:52,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882700343] [2024-11-08 15:32:52,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:52,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:52,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:52,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:52,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:52,420 INFO L87 Difference]: Start difference. First operand 481 states and 636 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-08 15:32:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:52,888 INFO L93 Difference]: Finished difference Result 1052 states and 1442 transitions. [2024-11-08 15:32:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:52,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 266 [2024-11-08 15:32:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:52,894 INFO L225 Difference]: With dead ends: 1052 [2024-11-08 15:32:52,894 INFO L226 Difference]: Without dead ends: 770 [2024-11-08 15:32:52,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:52,896 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 224 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:52,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 469 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:32:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-08 15:32:52,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 601. [2024-11-08 15:32:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 474 states have (on average 1.3164556962025316) internal successors, (624), 480 states have internal predecessors, (624), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-08 15:32:52,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 794 transitions. [2024-11-08 15:32:52,948 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 794 transitions. Word has length 266 [2024-11-08 15:32:52,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:52,949 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 794 transitions. [2024-11-08 15:32:52,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-08 15:32:52,949 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 794 transitions. [2024-11-08 15:32:52,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-08 15:32:52,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:52,952 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:52,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-08 15:32:52,952 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:52,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash 363579022, now seen corresponding path program 1 times [2024-11-08 15:32:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:52,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934138950] [2024-11-08 15:32:52,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:52,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:53,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:53,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:32:53,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:32:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:32:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-08 15:32:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-08 15:32:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-08 15:32:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-08 15:32:53,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,170 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-08 15:32:53,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:53,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934138950] [2024-11-08 15:32:53,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934138950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:53,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:53,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:53,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575128897] [2024-11-08 15:32:53,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:53,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:53,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:53,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:53,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:53,173 INFO L87 Difference]: Start difference. First operand 601 states and 794 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-08 15:32:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:53,708 INFO L93 Difference]: Finished difference Result 1329 states and 1806 transitions. [2024-11-08 15:32:53,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:53,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 267 [2024-11-08 15:32:53,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:53,715 INFO L225 Difference]: With dead ends: 1329 [2024-11-08 15:32:53,716 INFO L226 Difference]: Without dead ends: 960 [2024-11-08 15:32:53,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:53,719 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 225 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:53,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 497 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:32:53,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-08 15:32:53,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 952. [2024-11-08 15:32:53,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 745 states have (on average 1.3436241610738255) internal successors, (1001), 759 states have internal predecessors, (1001), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2024-11-08 15:32:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1279 transitions. [2024-11-08 15:32:53,799 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1279 transitions. Word has length 267 [2024-11-08 15:32:53,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:53,800 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1279 transitions. [2024-11-08 15:32:53,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-08 15:32:53,801 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1279 transitions. [2024-11-08 15:32:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-08 15:32:53,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:53,804 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:53,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-08 15:32:53,804 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:53,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:53,805 INFO L85 PathProgramCache]: Analyzing trace with hash -947160963, now seen corresponding path program 1 times [2024-11-08 15:32:53,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:53,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875655364] [2024-11-08 15:32:53,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:53,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:53,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:32:53,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:53,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:32:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:32:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-08 15:32:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:32:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-08 15:32:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-08 15:32:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,011 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-08 15:32:54,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:54,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875655364] [2024-11-08 15:32:54,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875655364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:54,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:54,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:32:54,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703180908] [2024-11-08 15:32:54,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:54,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:54,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:54,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:54,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:32:54,015 INFO L87 Difference]: Start difference. First operand 952 states and 1279 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 15:32:54,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:54,519 INFO L93 Difference]: Finished difference Result 2220 states and 3057 transitions. [2024-11-08 15:32:54,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:54,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 268 [2024-11-08 15:32:54,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:54,529 INFO L225 Difference]: With dead ends: 2220 [2024-11-08 15:32:54,529 INFO L226 Difference]: Without dead ends: 1540 [2024-11-08 15:32:54,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:32:54,532 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 225 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:54,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 524 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:32:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2024-11-08 15:32:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1526. [2024-11-08 15:32:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1187 states have (on average 1.3689974726200504) internal successors, (1625), 1215 states have internal predecessors, (1625), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-11-08 15:32:54,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2087 transitions. [2024-11-08 15:32:54,655 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2087 transitions. Word has length 268 [2024-11-08 15:32:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:54,656 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 2087 transitions. [2024-11-08 15:32:54,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 15:32:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2087 transitions. [2024-11-08 15:32:54,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-08 15:32:54,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:54,660 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:54,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-08 15:32:54,660 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:54,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:54,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1341527749, now seen corresponding path program 1 times [2024-11-08 15:32:54,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:54,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252912170] [2024-11-08 15:32:54,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:54,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:54,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:54,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:54,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:32:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:32:54,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:32:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-08 15:32:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:32:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-08 15:32:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-08 15:32:54,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-08 15:32:54,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:54,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252912170] [2024-11-08 15:32:54,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252912170] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:54,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638050856] [2024-11-08 15:32:54,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:54,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:54,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:54,969 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:54,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 15:32:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:55,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 15:32:55,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-11-08 15:32:55,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:32:55,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638050856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:55,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:32:55,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-08 15:32:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542250997] [2024-11-08 15:32:55,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:55,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:55,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:55,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:55,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:32:55,240 INFO L87 Difference]: Start difference. First operand 1526 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 15:32:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:55,437 INFO L93 Difference]: Finished difference Result 2820 states and 3914 transitions. [2024-11-08 15:32:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:55,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 268 [2024-11-08 15:32:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:55,447 INFO L225 Difference]: With dead ends: 2820 [2024-11-08 15:32:55,447 INFO L226 Difference]: Without dead ends: 1526 [2024-11-08 15:32:55,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:32:55,451 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 31 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:55,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 691 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:32:55,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2024-11-08 15:32:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1526. [2024-11-08 15:32:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1187 states have (on average 1.3487784330244312) internal successors, (1601), 1215 states have internal predecessors, (1601), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-11-08 15:32:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2063 transitions. [2024-11-08 15:32:55,569 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2063 transitions. Word has length 268 [2024-11-08 15:32:55,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:55,569 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 2063 transitions. [2024-11-08 15:32:55,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 15:32:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2063 transitions. [2024-11-08 15:32:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-08 15:32:55,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:55,575 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:55,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 15:32:55,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-08 15:32:55,776 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:55,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:55,777 INFO L85 PathProgramCache]: Analyzing trace with hash 731956630, now seen corresponding path program 1 times [2024-11-08 15:32:55,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:55,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308325945] [2024-11-08 15:32:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:55,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:55,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:55,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:55,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:55,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:55,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:56,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:56,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:56,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:32:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:32:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:32:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-08 15:32:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:32:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-08 15:32:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-08 15:32:56,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,142 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-11-08 15:32:56,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:56,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308325945] [2024-11-08 15:32:56,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308325945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:56,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576952133] [2024-11-08 15:32:56,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:56,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:56,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:56,145 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:56,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 15:32:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:56,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 15:32:56,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:56,424 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-08 15:32:56,424 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:32:56,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576952133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:56,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:32:56,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-08 15:32:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485611869] [2024-11-08 15:32:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:56,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:32:56,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:56,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:32:56,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:32:56,428 INFO L87 Difference]: Start difference. First operand 1526 states and 2063 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 15:32:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:56,583 INFO L93 Difference]: Finished difference Result 2820 states and 3858 transitions. [2024-11-08 15:32:56,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:32:56,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 269 [2024-11-08 15:32:56,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:56,594 INFO L225 Difference]: With dead ends: 2820 [2024-11-08 15:32:56,594 INFO L226 Difference]: Without dead ends: 1574 [2024-11-08 15:32:56,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:32:56,599 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 7 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:56,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 699 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:32:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2024-11-08 15:32:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2024-11-08 15:32:56,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1227 states have (on average 1.3504482477587612) internal successors, (1657), 1255 states have internal predecessors, (1657), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-11-08 15:32:56,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2119 transitions. [2024-11-08 15:32:56,709 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2119 transitions. Word has length 269 [2024-11-08 15:32:56,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:56,710 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2119 transitions. [2024-11-08 15:32:56,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-08 15:32:56,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2119 transitions. [2024-11-08 15:32:56,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-08 15:32:56,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:56,715 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:56,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 15:32:56,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-08 15:32:56,916 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1189094123, now seen corresponding path program 1 times [2024-11-08 15:32:56,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:56,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959735949] [2024-11-08 15:32:56,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:56,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:57,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:57,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:57,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:57,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:32:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:32:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:32:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-08 15:32:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:32:57,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-08 15:32:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-08 15:32:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:57,384 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-08 15:32:57,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:57,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959735949] [2024-11-08 15:32:57,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959735949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:32:57,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:32:57,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:32:57,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72328478] [2024-11-08 15:32:57,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:32:57,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:32:57,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:57,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:32:57,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:32:57,386 INFO L87 Difference]: Start difference. First operand 1574 states and 2119 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 15:32:58,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:32:58,102 INFO L93 Difference]: Finished difference Result 2404 states and 3466 transitions. [2024-11-08 15:32:58,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:32:58,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 270 [2024-11-08 15:32:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:32:58,118 INFO L225 Difference]: With dead ends: 2404 [2024-11-08 15:32:58,119 INFO L226 Difference]: Without dead ends: 2402 [2024-11-08 15:32:58,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:32:58,121 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 181 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 15:32:58,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1528 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 15:32:58,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2024-11-08 15:32:58,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1622. [2024-11-08 15:32:58,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1259 states have (on average 1.34154090548054) internal successors, (1689), 1295 states have internal predecessors, (1689), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2024-11-08 15:32:58,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2167 transitions. [2024-11-08 15:32:58,265 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2167 transitions. Word has length 270 [2024-11-08 15:32:58,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:32:58,266 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2167 transitions. [2024-11-08 15:32:58,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-08 15:32:58,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2167 transitions. [2024-11-08 15:32:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-08 15:32:58,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:32:58,269 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:32:58,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-08 15:32:58,269 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:32:58,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:32:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1337818136, now seen corresponding path program 1 times [2024-11-08 15:32:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:32:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108230654] [2024-11-08 15:32:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:58,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:32:58,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:32:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:32:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:32:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:32:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:32:58,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:32:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:32:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:32:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:32:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:32:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:32:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:32:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:32:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:32:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:32:58,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:32:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:32:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:32:58,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:32:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-08 15:32:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:32:58,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-08 15:32:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-08 15:32:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-08 15:32:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,721 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-08 15:32:58,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:32:58,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108230654] [2024-11-08 15:32:58,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108230654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:32:58,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035741242] [2024-11-08 15:32:58,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:32:58,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:32:58,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:32:58,724 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:32:58,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 15:32:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:32:58,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-08 15:32:58,955 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:32:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-08 15:32:59,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:32:59,542 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-08 15:32:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035741242] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:32:59,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:32:59,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2024-11-08 15:32:59,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115925710] [2024-11-08 15:32:59,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:32:59,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-08 15:32:59,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:32:59,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-08 15:32:59,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:32:59,547 INFO L87 Difference]: Start difference. First operand 1622 states and 2167 transitions. Second operand has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-08 15:33:01,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:01,717 INFO L93 Difference]: Finished difference Result 3978 states and 5504 transitions. [2024-11-08 15:33:01,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 15:33:01,718 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 278 [2024-11-08 15:33:01,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:01,733 INFO L225 Difference]: With dead ends: 3978 [2024-11-08 15:33:01,733 INFO L226 Difference]: Without dead ends: 2636 [2024-11-08 15:33:01,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 601 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 15:33:01,739 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 304 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:01,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2740 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 15:33:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2024-11-08 15:33:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2408. [2024-11-08 15:33:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 1862 states have (on average 1.3286788399570355) internal successors, (2474), 1914 states have internal predecessors, (2474), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2024-11-08 15:33:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3194 transitions. [2024-11-08 15:33:01,993 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3194 transitions. Word has length 278 [2024-11-08 15:33:01,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:01,993 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 3194 transitions. [2024-11-08 15:33:01,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-08 15:33:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3194 transitions. [2024-11-08 15:33:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-08 15:33:01,998 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:01,998 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:02,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 15:33:02,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:02,199 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:02,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:02,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1995535143, now seen corresponding path program 1 times [2024-11-08 15:33:02,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:02,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719024079] [2024-11-08 15:33:02,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:02,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:33:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:33:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:33:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:33:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:33:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:33:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:33:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:33:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:33:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:33:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:33:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:33:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:33:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:33:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:33:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:33:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:33:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:33:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-08 15:33:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:33:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-08 15:33:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-08 15:33:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-08 15:33:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-08 15:33:02,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:02,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719024079] [2024-11-08 15:33:02,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719024079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:33:02,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921176107] [2024-11-08 15:33:02,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:02,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:02,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:33:02,412 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:33:02,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 15:33:02,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:02,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 15:33:02,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:33:02,665 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-08 15:33:02,665 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:33:02,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921176107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:33:02,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:33:02,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-08 15:33:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815619831] [2024-11-08 15:33:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:33:02,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:33:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:02,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:33:02,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:33:02,668 INFO L87 Difference]: Start difference. First operand 2408 states and 3194 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 15:33:02,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:02,865 INFO L93 Difference]: Finished difference Result 4649 states and 6264 transitions. [2024-11-08 15:33:02,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:33:02,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 278 [2024-11-08 15:33:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:02,879 INFO L225 Difference]: With dead ends: 4649 [2024-11-08 15:33:02,879 INFO L226 Difference]: Without dead ends: 2344 [2024-11-08 15:33:02,886 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:33:02,887 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 4 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:02,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 699 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:33:02,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2024-11-08 15:33:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 2344. [2024-11-08 15:33:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1818 states have (on average 1.3113311331133113) internal successors, (2384), 1870 states have internal predecessors, (2384), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2024-11-08 15:33:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3068 transitions. [2024-11-08 15:33:03,090 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3068 transitions. Word has length 278 [2024-11-08 15:33:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:03,091 INFO L471 AbstractCegarLoop]: Abstraction has 2344 states and 3068 transitions. [2024-11-08 15:33:03,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 15:33:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3068 transitions. [2024-11-08 15:33:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-08 15:33:03,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:03,094 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:03,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-08 15:33:03,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:03,295 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:03,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1834324692, now seen corresponding path program 1 times [2024-11-08 15:33:03,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:03,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491914184] [2024-11-08 15:33:03,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:03,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:33:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:33:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:33:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:33:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:33:03,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:33:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:33:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:33:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:33:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:33:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:33:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:33:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:33:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 15:33:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:33:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-08 15:33:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-08 15:33:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-08 15:33:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-08 15:33:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-08 15:33:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-08 15:33:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-08 15:33:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-08 15:33:03,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-08 15:33:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-11-08 15:33:03,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491914184] [2024-11-08 15:33:03,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491914184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:33:03,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566223304] [2024-11-08 15:33:03,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:03,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:03,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:33:03,492 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:33:03,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 15:33:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:03,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 15:33:03,728 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:33:03,744 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2024-11-08 15:33:03,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:33:03,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566223304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:33:03,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:33:03,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-08 15:33:03,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609031194] [2024-11-08 15:33:03,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:33:03,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:33:03,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:03,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:33:03,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:33:03,747 INFO L87 Difference]: Start difference. First operand 2344 states and 3068 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 15:33:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:03,944 INFO L93 Difference]: Finished difference Result 4431 states and 5905 transitions. [2024-11-08 15:33:03,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:33:03,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 281 [2024-11-08 15:33:03,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:03,956 INFO L225 Difference]: With dead ends: 4431 [2024-11-08 15:33:03,957 INFO L226 Difference]: Without dead ends: 2172 [2024-11-08 15:33:03,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:33:03,963 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 4 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:03,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 727 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:33:03,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2024-11-08 15:33:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2172. [2024-11-08 15:33:04,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 1676 states have (on average 1.3048926014319808) internal successors, (2187), 1728 states have internal predecessors, (2187), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2024-11-08 15:33:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 2833 transitions. [2024-11-08 15:33:04,135 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 2833 transitions. Word has length 281 [2024-11-08 15:33:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:04,135 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 2833 transitions. [2024-11-08 15:33:04,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-08 15:33:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2833 transitions. [2024-11-08 15:33:04,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-08 15:33:04,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:04,139 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:04,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 15:33:04,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:04,344 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:04,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:04,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1939290951, now seen corresponding path program 1 times [2024-11-08 15:33:04,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:04,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325766148] [2024-11-08 15:33:04,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:04,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:33:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:33:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:33:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:33:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:33:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:33:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:33:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:33:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:33:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:33:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:33:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:33:04,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:33:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:33:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:33:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:33:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:33:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:33:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-08 15:33:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:33:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-08 15:33:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-08 15:33:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-08 15:33:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-08 15:33:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-08 15:33:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:04,843 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2024-11-08 15:33:04,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325766148] [2024-11-08 15:33:04,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325766148] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:33:04,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979031752] [2024-11-08 15:33:04,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:04,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:04,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:33:04,846 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:33:04,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 15:33:05,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:05,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 15:33:05,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:33:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-08 15:33:05,267 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:33:05,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979031752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:33:05,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:33:05,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-08 15:33:05,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624112481] [2024-11-08 15:33:05,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:33:05,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:33:05,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:05,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:33:05,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:33:05,270 INFO L87 Difference]: Start difference. First operand 2172 states and 2833 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 15:33:05,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:05,766 INFO L93 Difference]: Finished difference Result 4802 states and 6272 transitions. [2024-11-08 15:33:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:33:05,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 293 [2024-11-08 15:33:05,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:05,785 INFO L225 Difference]: With dead ends: 4802 [2024-11-08 15:33:05,785 INFO L226 Difference]: Without dead ends: 3196 [2024-11-08 15:33:05,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-11-08 15:33:05,794 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 128 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:05,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1736 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:33:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2024-11-08 15:33:06,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 3182. [2024-11-08 15:33:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 2447 states have (on average 1.298324478953821) internal successors, (3177), 2527 states have internal predecessors, (3177), 467 states have call successors, (467), 267 states have call predecessors, (467), 267 states have return successors, (467), 395 states have call predecessors, (467), 467 states have call successors, (467) [2024-11-08 15:33:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4111 transitions. [2024-11-08 15:33:06,060 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4111 transitions. Word has length 293 [2024-11-08 15:33:06,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:06,062 INFO L471 AbstractCegarLoop]: Abstraction has 3182 states and 4111 transitions. [2024-11-08 15:33:06,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 15:33:06,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4111 transitions. [2024-11-08 15:33:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-08 15:33:06,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:06,065 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:06,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-08 15:33:06,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-08 15:33:06,270 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:06,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:06,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1839544214, now seen corresponding path program 1 times [2024-11-08 15:33:06,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:06,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86009750] [2024-11-08 15:33:06,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:33:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:33:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:33:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:33:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:33:06,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:33:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:33:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:33:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:33:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:33:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:33:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:33:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:33:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:33:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:33:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:33:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:33:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:33:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-08 15:33:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:33:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-08 15:33:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-08 15:33:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-08 15:33:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-08 15:33:06,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-08 15:33:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-11-08 15:33:06,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:06,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86009750] [2024-11-08 15:33:06,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86009750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:33:06,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:33:06,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:33:06,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551243558] [2024-11-08 15:33:06,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:33:06,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:33:06,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:06,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:33:06,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:33:06,599 INFO L87 Difference]: Start difference. First operand 3182 states and 4111 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-08 15:33:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:07,188 INFO L93 Difference]: Finished difference Result 6182 states and 8177 transitions. [2024-11-08 15:33:07,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 15:33:07,189 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 299 [2024-11-08 15:33:07,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:07,215 INFO L225 Difference]: With dead ends: 6182 [2024-11-08 15:33:07,218 INFO L226 Difference]: Without dead ends: 3506 [2024-11-08 15:33:07,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:33:07,226 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 93 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:07,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 822 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 15:33:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2024-11-08 15:33:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3438. [2024-11-08 15:33:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 2655 states have (on average 1.3111111111111111) internal successors, (3481), 2735 states have internal predecessors, (3481), 515 states have call successors, (515), 267 states have call predecessors, (515), 267 states have return successors, (515), 443 states have call predecessors, (515), 515 states have call successors, (515) [2024-11-08 15:33:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4511 transitions. [2024-11-08 15:33:07,464 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4511 transitions. Word has length 299 [2024-11-08 15:33:07,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:07,465 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 4511 transitions. [2024-11-08 15:33:07,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-08 15:33:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4511 transitions. [2024-11-08 15:33:07,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-08 15:33:07,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:07,468 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:07,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-08 15:33:07,469 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:07,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:07,469 INFO L85 PathProgramCache]: Analyzing trace with hash 9129234, now seen corresponding path program 1 times [2024-11-08 15:33:07,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:07,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69040336] [2024-11-08 15:33:07,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:07,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:07,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:33:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:33:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:33:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:33:07,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:33:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:33:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:33:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:33:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:33:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:33:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:33:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:33:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:33:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:33:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:33:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:33:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:33:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-08 15:33:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-08 15:33:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:33:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-08 15:33:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-08 15:33:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-08 15:33:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-08 15:33:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-08 15:33:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:07,917 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2024-11-08 15:33:07,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:07,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69040336] [2024-11-08 15:33:07,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69040336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:33:07,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:33:07,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:33:07,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508421673] [2024-11-08 15:33:07,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:33:07,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:33:07,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:07,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:33:07,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:33:07,920 INFO L87 Difference]: Start difference. First operand 3438 states and 4511 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 15:33:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:08,451 INFO L93 Difference]: Finished difference Result 6215 states and 8207 transitions. [2024-11-08 15:33:08,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 15:33:08,451 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 299 [2024-11-08 15:33:08,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:08,472 INFO L225 Difference]: With dead ends: 6215 [2024-11-08 15:33:08,472 INFO L226 Difference]: Without dead ends: 3384 [2024-11-08 15:33:08,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:33:08,479 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 61 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:08,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 781 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:33:08,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2024-11-08 15:33:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3384. [2024-11-08 15:33:08,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3384 states, 2610 states have (on average 1.3080459770114943) internal successors, (3414), 2685 states have internal predecessors, (3414), 511 states have call successors, (511), 263 states have call predecessors, (511), 262 states have return successors, (510), 442 states have call predecessors, (510), 510 states have call successors, (510) [2024-11-08 15:33:08,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 4435 transitions. [2024-11-08 15:33:08,790 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 4435 transitions. Word has length 299 [2024-11-08 15:33:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:08,791 INFO L471 AbstractCegarLoop]: Abstraction has 3384 states and 4435 transitions. [2024-11-08 15:33:08,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-08 15:33:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 4435 transitions. [2024-11-08 15:33:08,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-08 15:33:08,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:08,796 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:08,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-08 15:33:08,796 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:08,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash -788096576, now seen corresponding path program 1 times [2024-11-08 15:33:08,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:08,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256542987] [2024-11-08 15:33:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:33:09,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:33:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:33:09,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:33:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:33:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:33:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:33:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:33:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:33:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:33:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:33:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:33:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:33:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:33:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:33:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:33:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:33:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 15:33:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-08 15:33:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:33:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-08 15:33:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-08 15:33:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-08 15:33:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-08 15:33:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-08 15:33:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-11-08 15:33:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-08 15:33:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256542987] [2024-11-08 15:33:09,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256542987] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:33:09,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889958673] [2024-11-08 15:33:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:09,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:09,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:33:09,278 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:33:09,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 15:33:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:09,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-08 15:33:09,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:33:09,714 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 189 proven. 4 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-08 15:33:09,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:33:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-08 15:33:09,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889958673] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-08 15:33:09,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-08 15:33:09,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 10] total 18 [2024-11-08 15:33:09,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111645351] [2024-11-08 15:33:09,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:33:09,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 15:33:09,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:09,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 15:33:09,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:33:09,880 INFO L87 Difference]: Start difference. First operand 3384 states and 4435 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 15:33:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:10,925 INFO L93 Difference]: Finished difference Result 10534 states and 13758 transitions. [2024-11-08 15:33:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 15:33:10,926 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 304 [2024-11-08 15:33:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:10,958 INFO L225 Difference]: With dead ends: 10534 [2024-11-08 15:33:10,958 INFO L226 Difference]: Without dead ends: 7670 [2024-11-08 15:33:10,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 656 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2024-11-08 15:33:10,969 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 667 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:10,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 2735 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 15:33:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2024-11-08 15:33:11,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 5490. [2024-11-08 15:33:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5490 states, 4214 states have (on average 1.3028001898433792) internal successors, (5490), 4334 states have internal predecessors, (5490), 852 states have call successors, (852), 424 states have call predecessors, (852), 423 states have return successors, (851), 738 states have call predecessors, (851), 851 states have call successors, (851) [2024-11-08 15:33:11,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5490 states to 5490 states and 7193 transitions. [2024-11-08 15:33:11,470 INFO L78 Accepts]: Start accepts. Automaton has 5490 states and 7193 transitions. Word has length 304 [2024-11-08 15:33:11,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:11,471 INFO L471 AbstractCegarLoop]: Abstraction has 5490 states and 7193 transitions. [2024-11-08 15:33:11,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 15:33:11,471 INFO L276 IsEmpty]: Start isEmpty. Operand 5490 states and 7193 transitions. [2024-11-08 15:33:11,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-08 15:33:11,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:11,474 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:11,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-08 15:33:11,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-08 15:33:11,675 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:11,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:11,675 INFO L85 PathProgramCache]: Analyzing trace with hash -112763456, now seen corresponding path program 1 times [2024-11-08 15:33:11,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:11,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641275895] [2024-11-08 15:33:11,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:11,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:33:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:33:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:33:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:33:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:33:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:33:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:33:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:33:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:33:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:33:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:33:11,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:33:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:33:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:33:11,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:33:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:33:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:33:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 15:33:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-08 15:33:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:33:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-08 15:33:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-08 15:33:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-08 15:33:11,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-08 15:33:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-08 15:33:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-11-08 15:33:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:11,984 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-08 15:33:11,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641275895] [2024-11-08 15:33:11,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641275895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:33:11,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004471713] [2024-11-08 15:33:11,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:11,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:11,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:33:11,987 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:33:11,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 15:33:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:12,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-08 15:33:12,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:33:12,309 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-08 15:33:12,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:33:12,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004471713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:33:12,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:33:12,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 10 [2024-11-08 15:33:12,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551146603] [2024-11-08 15:33:12,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:33:12,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 15:33:12,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:12,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 15:33:12,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:33:12,312 INFO L87 Difference]: Start difference. First operand 5490 states and 7193 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 15:33:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:12,836 INFO L93 Difference]: Finished difference Result 10586 states and 13865 transitions. [2024-11-08 15:33:12,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:33:12,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 304 [2024-11-08 15:33:12,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:12,859 INFO L225 Difference]: With dead ends: 10586 [2024-11-08 15:33:12,860 INFO L226 Difference]: Without dead ends: 5568 [2024-11-08 15:33:12,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:33:12,871 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 122 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:12,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1709 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:33:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2024-11-08 15:33:13,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 5326. [2024-11-08 15:33:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5326 states, 4090 states have (on average 1.2953545232273838) internal successors, (5298), 4206 states have internal predecessors, (5298), 816 states have call successors, (816), 420 states have call predecessors, (816), 419 states have return successors, (815), 706 states have call predecessors, (815), 815 states have call successors, (815) [2024-11-08 15:33:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 6929 transitions. [2024-11-08 15:33:13,258 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 6929 transitions. Word has length 304 [2024-11-08 15:33:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:13,258 INFO L471 AbstractCegarLoop]: Abstraction has 5326 states and 6929 transitions. [2024-11-08 15:33:13,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-08 15:33:13,259 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 6929 transitions. [2024-11-08 15:33:13,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-11-08 15:33:13,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:13,264 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:13,282 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 15:33:13,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-08 15:33:13,465 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:13,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:13,466 INFO L85 PathProgramCache]: Analyzing trace with hash -446467712, now seen corresponding path program 1 times [2024-11-08 15:33:13,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:13,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605714430] [2024-11-08 15:33:13,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:13,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:33:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:33:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:33:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:33:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:33:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:33:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:33:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:33:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:33:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:33:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:33:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:33:13,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:33:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:33:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:33:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:33:13,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:33:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 15:33:13,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-08 15:33:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:33:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-08 15:33:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-08 15:33:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-08 15:33:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-08 15:33:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-08 15:33:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-08 15:33:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-08 15:33:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:13,665 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-11-08 15:33:13,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:13,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605714430] [2024-11-08 15:33:13,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605714430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:33:13,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:33:13,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 15:33:13,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826420928] [2024-11-08 15:33:13,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:33:13,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:33:13,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:13,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:33:13,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:33:13,668 INFO L87 Difference]: Start difference. First operand 5326 states and 6929 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 15:33:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:33:14,659 INFO L93 Difference]: Finished difference Result 8964 states and 11706 transitions. [2024-11-08 15:33:14,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 15:33:14,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 311 [2024-11-08 15:33:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:33:14,683 INFO L225 Difference]: With dead ends: 8964 [2024-11-08 15:33:14,683 INFO L226 Difference]: Without dead ends: 4406 [2024-11-08 15:33:14,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 15:33:14,698 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 475 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 15:33:14,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 758 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 15:33:14,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2024-11-08 15:33:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 4380. [2024-11-08 15:33:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4380 states, 3369 states have (on average 1.2766399525081626) internal successors, (4301), 3463 states have internal predecessors, (4301), 665 states have call successors, (665), 345 states have call predecessors, (665), 345 states have return successors, (665), 571 states have call predecessors, (665), 665 states have call successors, (665) [2024-11-08 15:33:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 5631 transitions. [2024-11-08 15:33:15,205 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 5631 transitions. Word has length 311 [2024-11-08 15:33:15,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:33:15,206 INFO L471 AbstractCegarLoop]: Abstraction has 4380 states and 5631 transitions. [2024-11-08 15:33:15,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-08 15:33:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 5631 transitions. [2024-11-08 15:33:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-08 15:33:15,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:33:15,214 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:33:15,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-08 15:33:15,215 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:33:15,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:33:15,215 INFO L85 PathProgramCache]: Analyzing trace with hash -409137599, now seen corresponding path program 1 times [2024-11-08 15:33:15,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:33:15,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961120059] [2024-11-08 15:33:15,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:15,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:33:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-08 15:33:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-08 15:33:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-08 15:33:16,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:33:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 15:33:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 15:33:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 15:33:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:33:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:33:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 15:33:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 15:33:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 15:33:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:33:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-08 15:33:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-08 15:33:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 15:33:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-08 15:33:16,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-08 15:33:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-08 15:33:16,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-08 15:33:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-08 15:33:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-08 15:33:16,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-08 15:33:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-08 15:33:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-08 15:33:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-08 15:33:16,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-08 15:33:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-08 15:33:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2024-11-08 15:33:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-08 15:33:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-08 15:33:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-08 15:33:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-11-08 15:33:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-11-08 15:33:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 22 proven. 28 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2024-11-08 15:33:16,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:33:16,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961120059] [2024-11-08 15:33:16,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961120059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:33:16,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389913367] [2024-11-08 15:33:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:33:16,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:33:16,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:33:16,290 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 15:33:16,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 15:33:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:33:16,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-08 15:33:16,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:33:17,544 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 211 proven. 122 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2024-11-08 15:33:17,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:33:18,472 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-11-08 15:33:18,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389913367] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:33:18,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:33:18,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 18] total 44 [2024-11-08 15:33:18,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422345033] [2024-11-08 15:33:18,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:33:18,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-08 15:33:18,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:33:18,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-08 15:33:18,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1737, Unknown=0, NotChecked=0, Total=1892 [2024-11-08 15:33:18,477 INFO L87 Difference]: Start difference. First operand 4380 states and 5631 transitions. Second operand has 44 states, 43 states have (on average 7.116279069767442) internal successors, (306), 39 states have internal predecessors, (306), 20 states have call successors, (72), 9 states have call predecessors, (72), 10 states have return successors, (68), 22 states have call predecessors, (68), 19 states have call successors, (68)