./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.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 b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:54:12,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:54:12,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:54:12,597 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:54:12,597 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:54:12,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:54:12,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:54:12,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:54:12,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:54:12,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:54:12,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:54:12,627 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:54:12,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:54:12,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:54:12,628 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:54:12,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:54:12,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:54:12,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:54:12,630 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:54:12,630 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:54:12,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:54:12,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:54:12,636 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:54:12,636 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:54:12,636 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:54:12,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:54:12,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:54:12,637 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:54:12,637 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:54:12,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:54:12,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:54:12,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:54:12,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:54:12,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:54:12,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:54:12,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:54:12,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:54:12,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:54:12,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:54:12,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:54:12,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:54:12,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:54:12,641 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 -> b74079121634b4e5d8b815834e604eed77442466d93875e78a8cab3fe135fa1f [2024-10-12 19:54:12,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:54:12,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:54:12,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:54:12,900 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:54:12,900 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:54:12,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2024-10-12 19:54:14,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:54:14,537 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:54:14,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c [2024-10-12 19:54:14,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefb78fa1/2a7667b806814cbaa71e55616022a4a4/FLAG5cbfe81bb [2024-10-12 19:54:14,901 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cefb78fa1/2a7667b806814cbaa71e55616022a4a4 [2024-10-12 19:54:14,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:54:14,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:54:14,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:54:14,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:54:14,921 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:54:14,922 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:54:14" (1/1) ... [2024-10-12 19:54:14,925 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5855e886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:14, skipping insertion in model container [2024-10-12 19:54:14,925 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:54:14" (1/1) ... [2024-10-12 19:54:14,951 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:54:15,117 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2024-10-12 19:54:15,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:54:15,196 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:54:15,208 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/pc_sfifo_2.cil-1.c[643,656] [2024-10-12 19:54:15,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:54:15,262 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:54:15,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15 WrapperNode [2024-10-12 19:54:15,263 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:54:15,264 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:54:15,264 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:54:15,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:54:15,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,282 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,311 INFO L138 Inliner]: procedures = 29, calls = 31, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 189 [2024-10-12 19:54:15,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:54:15,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:54:15,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:54:15,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:54:15,324 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,329 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,350 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 19:54:15,350 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:54:15,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:54:15,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:54:15,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:54:15,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (1/1) ... [2024-10-12 19:54:15,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:54:15,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:15,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:54:15,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:54:15,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:54:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-10-12 19:54:15,458 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-10-12 19:54:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-10-12 19:54:15,458 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-10-12 19:54:15,458 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-12 19:54:15,459 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-12 19:54:15,459 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-12 19:54:15,460 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-12 19:54:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-12 19:54:15,461 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-12 19:54:15,461 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-12 19:54:15,461 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-12 19:54:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:54:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-12 19:54:15,462 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-12 19:54:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:54:15,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:54:15,462 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-10-12 19:54:15,463 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-10-12 19:54:15,545 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:54:15,550 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:54:15,883 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-10-12 19:54:15,884 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:54:15,936 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:54:15,936 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-12 19:54:15,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:54:15 BoogieIcfgContainer [2024-10-12 19:54:15,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:54:15,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:54:15,940 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:54:15,943 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:54:15,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:54:14" (1/3) ... [2024-10-12 19:54:15,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acea914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:54:15, skipping insertion in model container [2024-10-12 19:54:15,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:54:15" (2/3) ... [2024-10-12 19:54:15,945 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5acea914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:54:15, skipping insertion in model container [2024-10-12 19:54:15,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:54:15" (3/3) ... [2024-10-12 19:54:15,946 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1.c [2024-10-12 19:54:15,963 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:54:15,963 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:54:16,039 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:54:16,048 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;@7e0e4d92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:54:16,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:54:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 71 states have internal predecessors, (108), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-12 19:54:16,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:54:16,062 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:16,063 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:16,064 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:16,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:16,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1654461006, now seen corresponding path program 1 times [2024-10-12 19:54:16,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:16,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911056120] [2024-10-12 19:54:16,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:16,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:16,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:16,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911056120] [2024-10-12 19:54:16,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911056120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:16,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:16,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:54:16,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437610539] [2024-10-12 19:54:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:16,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:54:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:16,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:54:16,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:54:16,572 INFO L87 Difference]: Start difference. First operand has 91 states, 67 states have (on average 1.6119402985074627) internal successors, (108), 71 states have internal predecessors, (108), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:17,031 INFO L93 Difference]: Finished difference Result 193 states and 291 transitions. [2024-10-12 19:54:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:54:17,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-12 19:54:17,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:17,042 INFO L225 Difference]: With dead ends: 193 [2024-10-12 19:54:17,043 INFO L226 Difference]: Without dead ends: 105 [2024-10-12 19:54:17,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:54:17,049 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 196 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:17,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 196 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:54:17,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-12 19:54:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2024-10-12 19:54:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 68 states have internal predecessors, (96), 14 states have call successors, (14), 8 states have call predecessors, (14), 7 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-12 19:54:17,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 122 transitions. [2024-10-12 19:54:17,108 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 122 transitions. Word has length 57 [2024-10-12 19:54:17,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:17,110 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 122 transitions. [2024-10-12 19:54:17,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 122 transitions. [2024-10-12 19:54:17,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:54:17,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:17,115 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:17,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:54:17,115 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:17,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:17,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1173380748, now seen corresponding path program 1 times [2024-10-12 19:54:17,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:17,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076025579] [2024-10-12 19:54:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:17,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:17,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:17,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:17,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:17,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:17,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076025579] [2024-10-12 19:54:17,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076025579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:17,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:17,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:54:17,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998824950] [2024-10-12 19:54:17,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:17,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:54:17,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:17,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:54:17,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:54:17,408 INFO L87 Difference]: Start difference. First operand 88 states and 122 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:18,090 INFO L93 Difference]: Finished difference Result 294 states and 419 transitions. [2024-10-12 19:54:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:54:18,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-12 19:54:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:18,094 INFO L225 Difference]: With dead ends: 294 [2024-10-12 19:54:18,096 INFO L226 Difference]: Without dead ends: 213 [2024-10-12 19:54:18,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:54:18,099 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 442 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:18,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 254 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:54:18,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-12 19:54:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 176. [2024-10-12 19:54:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 134 states have (on average 1.4328358208955223) internal successors, (192), 138 states have internal predecessors, (192), 25 states have call successors, (25), 15 states have call predecessors, (25), 16 states have return successors, (28), 24 states have call predecessors, (28), 23 states have call successors, (28) [2024-10-12 19:54:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 245 transitions. [2024-10-12 19:54:18,136 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 245 transitions. Word has length 57 [2024-10-12 19:54:18,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:18,136 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 245 transitions. [2024-10-12 19:54:18,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 245 transitions. [2024-10-12 19:54:18,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:54:18,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:18,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:18,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:54:18,140 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:18,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:18,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2030424501, now seen corresponding path program 1 times [2024-10-12 19:54:18,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:18,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848347638] [2024-10-12 19:54:18,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:18,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:18,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:18,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:18,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:18,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:18,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:18,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:18,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:18,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:18,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:18,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:18,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:18,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848347638] [2024-10-12 19:54:18,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848347638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:18,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:18,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:54:18,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168524262] [2024-10-12 19:54:18,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:18,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:54:18,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:18,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:54:18,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:54:18,336 INFO L87 Difference]: Start difference. First operand 176 states and 245 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:19,079 INFO L93 Difference]: Finished difference Result 496 states and 694 transitions. [2024-10-12 19:54:19,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:54:19,080 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-12 19:54:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:19,083 INFO L225 Difference]: With dead ends: 496 [2024-10-12 19:54:19,083 INFO L226 Difference]: Without dead ends: 334 [2024-10-12 19:54:19,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:54:19,086 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 317 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:19,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 579 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:54:19,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-12 19:54:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 264. [2024-10-12 19:54:19,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.4207920792079207) internal successors, (287), 208 states have internal predecessors, (287), 36 states have call successors, (36), 22 states have call predecessors, (36), 25 states have return successors, (47), 36 states have call predecessors, (47), 34 states have call successors, (47) [2024-10-12 19:54:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 370 transitions. [2024-10-12 19:54:19,137 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 370 transitions. Word has length 57 [2024-10-12 19:54:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:19,138 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 370 transitions. [2024-10-12 19:54:19,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 370 transitions. [2024-10-12 19:54:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:54:19,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:19,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:19,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:54:19,143 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:19,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:19,143 INFO L85 PathProgramCache]: Analyzing trace with hash -336270093, now seen corresponding path program 1 times [2024-10-12 19:54:19,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:19,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922178572] [2024-10-12 19:54:19,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:19,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:19,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:19,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922178572] [2024-10-12 19:54:19,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922178572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:19,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:19,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:54:19,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773466171] [2024-10-12 19:54:19,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:19,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:54:19,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:19,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:54:19,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:54:19,300 INFO L87 Difference]: Start difference. First operand 264 states and 370 transitions. Second operand has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:54:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:19,766 INFO L93 Difference]: Finished difference Result 538 states and 756 transitions. [2024-10-12 19:54:19,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:54:19,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 57 [2024-10-12 19:54:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:19,770 INFO L225 Difference]: With dead ends: 538 [2024-10-12 19:54:19,773 INFO L226 Difference]: Without dead ends: 294 [2024-10-12 19:54:19,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:54:19,778 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 148 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:19,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 379 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:54:19,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-10-12 19:54:19,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 268. [2024-10-12 19:54:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 205 states have (on average 1.4048780487804877) internal successors, (288), 211 states have internal predecessors, (288), 36 states have call successors, (36), 22 states have call predecessors, (36), 26 states have return successors, (48), 37 states have call predecessors, (48), 34 states have call successors, (48) [2024-10-12 19:54:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 372 transitions. [2024-10-12 19:54:19,852 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 372 transitions. Word has length 57 [2024-10-12 19:54:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:19,852 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 372 transitions. [2024-10-12 19:54:19,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.25) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:54:19,853 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 372 transitions. [2024-10-12 19:54:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 19:54:19,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:19,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:19,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:54:19,859 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:19,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:19,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1714713905, now seen corresponding path program 1 times [2024-10-12 19:54:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:19,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982440487] [2024-10-12 19:54:19,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:19,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:19,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982440487] [2024-10-12 19:54:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982440487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:19,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:19,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:19,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938788017] [2024-10-12 19:54:19,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:19,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:19,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:19,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:19,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:19,974 INFO L87 Difference]: Start difference. First operand 268 states and 372 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:20,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:20,514 INFO L93 Difference]: Finished difference Result 804 states and 1105 transitions. [2024-10-12 19:54:20,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:54:20,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 57 [2024-10-12 19:54:20,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:20,519 INFO L225 Difference]: With dead ends: 804 [2024-10-12 19:54:20,519 INFO L226 Difference]: Without dead ends: 556 [2024-10-12 19:54:20,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:54:20,521 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 466 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:20,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 335 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:54:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-12 19:54:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 485. [2024-10-12 19:54:20,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 372 states have (on average 1.3736559139784945) internal successors, (511), 382 states have internal predecessors, (511), 60 states have call successors, (60), 43 states have call predecessors, (60), 52 states have return successors, (81), 62 states have call predecessors, (81), 58 states have call successors, (81) [2024-10-12 19:54:20,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 652 transitions. [2024-10-12 19:54:20,580 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 652 transitions. Word has length 57 [2024-10-12 19:54:20,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:20,581 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 652 transitions. [2024-10-12 19:54:20,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 652 transitions. [2024-10-12 19:54:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:54:20,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:20,583 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:20,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:54:20,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:20,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:20,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1503158972, now seen corresponding path program 1 times [2024-10-12 19:54:20,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:20,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99131011] [2024-10-12 19:54:20,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:20,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:20,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:20,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:20,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:20,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:20,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:20,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:20,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:20,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:20,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99131011] [2024-10-12 19:54:20,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99131011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:20,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:54:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175984890] [2024-10-12 19:54:20,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:20,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:54:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:20,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:54:20,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:54:20,730 INFO L87 Difference]: Start difference. First operand 485 states and 652 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:54:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:21,183 INFO L93 Difference]: Finished difference Result 1012 states and 1361 transitions. [2024-10-12 19:54:21,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:54:21,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2024-10-12 19:54:21,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:21,187 INFO L225 Difference]: With dead ends: 1012 [2024-10-12 19:54:21,187 INFO L226 Difference]: Without dead ends: 547 [2024-10-12 19:54:21,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:54:21,189 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 105 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:21,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 421 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:54:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2024-10-12 19:54:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 497. [2024-10-12 19:54:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 381 states have (on average 1.356955380577428) internal successors, (517), 391 states have internal predecessors, (517), 60 states have call successors, (60), 43 states have call predecessors, (60), 55 states have return successors, (84), 65 states have call predecessors, (84), 58 states have call successors, (84) [2024-10-12 19:54:21,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 661 transitions. [2024-10-12 19:54:21,236 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 661 transitions. Word has length 58 [2024-10-12 19:54:21,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:21,237 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 661 transitions. [2024-10-12 19:54:21,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 5 states have internal predecessors, (43), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:54:21,238 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 661 transitions. [2024-10-12 19:54:21,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:54:21,239 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:21,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:21,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:54:21,240 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:21,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:21,241 INFO L85 PathProgramCache]: Analyzing trace with hash -868580290, now seen corresponding path program 1 times [2024-10-12 19:54:21,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:21,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507615427] [2024-10-12 19:54:21,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:21,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:21,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:21,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:21,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:21,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:21,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:21,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:21,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:21,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:21,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507615427] [2024-10-12 19:54:21,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507615427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:21,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:21,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:54:21,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595884894] [2024-10-12 19:54:21,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:21,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:54:21,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:21,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:54:21,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:54:21,389 INFO L87 Difference]: Start difference. First operand 497 states and 661 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:22,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:22,035 INFO L93 Difference]: Finished difference Result 1071 states and 1388 transitions. [2024-10-12 19:54:22,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:54:22,036 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-12 19:54:22,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:22,040 INFO L225 Difference]: With dead ends: 1071 [2024-10-12 19:54:22,040 INFO L226 Difference]: Without dead ends: 664 [2024-10-12 19:54:22,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:54:22,042 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 377 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:22,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 295 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:54:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2024-10-12 19:54:22,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 505. [2024-10-12 19:54:22,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 388 states have (on average 1.347938144329897) internal successors, (523), 397 states have internal predecessors, (523), 61 states have call successors, (61), 44 states have call predecessors, (61), 55 states have return successors, (81), 66 states have call predecessors, (81), 59 states have call successors, (81) [2024-10-12 19:54:22,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 665 transitions. [2024-10-12 19:54:22,104 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 665 transitions. Word has length 58 [2024-10-12 19:54:22,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:22,105 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 665 transitions. [2024-10-12 19:54:22,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:22,105 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 665 transitions. [2024-10-12 19:54:22,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-12 19:54:22,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:22,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:22,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:54:22,107 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:22,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:22,107 INFO L85 PathProgramCache]: Analyzing trace with hash -649725572, now seen corresponding path program 1 times [2024-10-12 19:54:22,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:22,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197055977] [2024-10-12 19:54:22,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:22,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:22,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:22,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:22,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197055977] [2024-10-12 19:54:22,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197055977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:22,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:22,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:22,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453276312] [2024-10-12 19:54:22,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:22,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:22,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:22,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:22,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:22,217 INFO L87 Difference]: Start difference. First operand 505 states and 665 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:22,677 INFO L93 Difference]: Finished difference Result 1536 states and 2010 transitions. [2024-10-12 19:54:22,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:54:22,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 58 [2024-10-12 19:54:22,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:22,684 INFO L225 Difference]: With dead ends: 1536 [2024-10-12 19:54:22,684 INFO L226 Difference]: Without dead ends: 1054 [2024-10-12 19:54:22,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:54:22,687 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 276 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:22,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 271 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:54:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2024-10-12 19:54:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 962. [2024-10-12 19:54:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 728 states have (on average 1.3104395604395604) internal successors, (954), 748 states have internal predecessors, (954), 121 states have call successors, (121), 87 states have call predecessors, (121), 112 states have return successors, (177), 132 states have call predecessors, (177), 119 states have call successors, (177) [2024-10-12 19:54:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1252 transitions. [2024-10-12 19:54:22,782 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1252 transitions. Word has length 58 [2024-10-12 19:54:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:22,784 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1252 transitions. [2024-10-12 19:54:22,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-12 19:54:22,784 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1252 transitions. [2024-10-12 19:54:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 19:54:22,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:22,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:22,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:54:22,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:22,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2016957774, now seen corresponding path program 1 times [2024-10-12 19:54:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:22,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134040123] [2024-10-12 19:54:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:22,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:22,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:22,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:22,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134040123] [2024-10-12 19:54:22,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134040123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:22,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:22,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:54:22,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001434654] [2024-10-12 19:54:22,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:22,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:54:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:22,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:54:22,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:54:22,868 INFO L87 Difference]: Start difference. First operand 962 states and 1252 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:54:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:23,333 INFO L93 Difference]: Finished difference Result 2922 states and 3799 transitions. [2024-10-12 19:54:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:54:23,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2024-10-12 19:54:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:23,344 INFO L225 Difference]: With dead ends: 2922 [2024-10-12 19:54:23,344 INFO L226 Difference]: Without dead ends: 1962 [2024-10-12 19:54:23,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:54:23,348 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 369 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:23,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 181 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:54:23,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-10-12 19:54:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1778. [2024-10-12 19:54:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1778 states, 1346 states have (on average 1.2942050520059436) internal successors, (1742), 1372 states have internal predecessors, (1742), 215 states have call successors, (215), 173 states have call predecessors, (215), 216 states have return successors, (315), 238 states have call predecessors, (315), 213 states have call successors, (315) [2024-10-12 19:54:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1778 states to 1778 states and 2272 transitions. [2024-10-12 19:54:23,522 INFO L78 Accepts]: Start accepts. Automaton has 1778 states and 2272 transitions. Word has length 59 [2024-10-12 19:54:23,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:23,522 INFO L471 AbstractCegarLoop]: Abstraction has 1778 states and 2272 transitions. [2024-10-12 19:54:23,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:54:23,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1778 states and 2272 transitions. [2024-10-12 19:54:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-12 19:54:23,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:23,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:23,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:54:23,525 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:23,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:23,525 INFO L85 PathProgramCache]: Analyzing trace with hash -321283507, now seen corresponding path program 1 times [2024-10-12 19:54:23,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:23,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294374882] [2024-10-12 19:54:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:23,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:23,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:23,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:23,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:23,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:23,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:23,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:23,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:23,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294374882] [2024-10-12 19:54:23,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294374882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:23,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:23,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:54:23,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454574761] [2024-10-12 19:54:23,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:23,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:54:23,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:23,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:54:23,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:54:23,592 INFO L87 Difference]: Start difference. First operand 1778 states and 2272 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:54:24,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:24,142 INFO L93 Difference]: Finished difference Result 4442 states and 5658 transitions. [2024-10-12 19:54:24,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:54:24,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-10-12 19:54:24,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:24,156 INFO L225 Difference]: With dead ends: 4442 [2024-10-12 19:54:24,156 INFO L226 Difference]: Without dead ends: 2686 [2024-10-12 19:54:24,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:54:24,161 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 346 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:24,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 218 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:54:24,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2024-10-12 19:54:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2444. [2024-10-12 19:54:24,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2444 states, 1848 states have (on average 1.2846320346320346) internal successors, (2374), 1882 states have internal predecessors, (2374), 295 states have call successors, (295), 243 states have call predecessors, (295), 300 states have return successors, (424), 324 states have call predecessors, (424), 293 states have call successors, (424) [2024-10-12 19:54:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2444 states to 2444 states and 3093 transitions. [2024-10-12 19:54:24,426 INFO L78 Accepts]: Start accepts. Automaton has 2444 states and 3093 transitions. Word has length 65 [2024-10-12 19:54:24,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:24,426 INFO L471 AbstractCegarLoop]: Abstraction has 2444 states and 3093 transitions. [2024-10-12 19:54:24,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-12 19:54:24,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2444 states and 3093 transitions. [2024-10-12 19:54:24,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-12 19:54:24,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:24,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:24,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:54:24,429 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:24,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1885701990, now seen corresponding path program 1 times [2024-10-12 19:54:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862902810] [2024-10-12 19:54:24,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:24,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:24,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:24,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:24,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:24,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:24,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:24,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:24,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:24,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:24,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862902810] [2024-10-12 19:54:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862902810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:24,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614628183] [2024-10-12 19:54:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:24,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:24,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:24,526 INFO L87 Difference]: Start difference. First operand 2444 states and 3093 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-12 19:54:25,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:25,212 INFO L93 Difference]: Finished difference Result 3164 states and 3964 transitions. [2024-10-12 19:54:25,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:54:25,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2024-10-12 19:54:25,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:25,227 INFO L225 Difference]: With dead ends: 3164 [2024-10-12 19:54:25,227 INFO L226 Difference]: Without dead ends: 3161 [2024-10-12 19:54:25,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:54:25,229 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 438 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:25,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 242 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:54:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3161 states. [2024-10-12 19:54:25,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3161 to 2894. [2024-10-12 19:54:25,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2894 states, 2189 states have (on average 1.277295568752855) internal successors, (2796), 2228 states have internal predecessors, (2796), 345 states have call successors, (345), 287 states have call predecessors, (345), 359 states have return successors, (503), 384 states have call predecessors, (503), 344 states have call successors, (503) [2024-10-12 19:54:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2894 states to 2894 states and 3644 transitions. [2024-10-12 19:54:25,534 INFO L78 Accepts]: Start accepts. Automaton has 2894 states and 3644 transitions. Word has length 66 [2024-10-12 19:54:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:25,535 INFO L471 AbstractCegarLoop]: Abstraction has 2894 states and 3644 transitions. [2024-10-12 19:54:25,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-12 19:54:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2894 states and 3644 transitions. [2024-10-12 19:54:25,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-12 19:54:25,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:25,536 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:25,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:54:25,537 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:25,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:25,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1672428599, now seen corresponding path program 1 times [2024-10-12 19:54:25,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:25,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783707204] [2024-10-12 19:54:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:25,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:25,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:25,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:25,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:25,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:25,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:25,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:25,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:25,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783707204] [2024-10-12 19:54:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783707204] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:54:25,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749699414] [2024-10-12 19:54:25,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:25,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:25,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:25,673 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:54:25,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:54:25,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:25,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 19:54:25,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:54:26,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:26,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:54:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749699414] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:54:26,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:54:26,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2024-10-12 19:54:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593858258] [2024-10-12 19:54:26,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:54:26,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:54:26,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:26,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:54:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:54:26,153 INFO L87 Difference]: Start difference. First operand 2894 states and 3644 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-12 19:54:28,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:28,014 INFO L93 Difference]: Finished difference Result 6961 states and 8720 transitions. [2024-10-12 19:54:28,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-12 19:54:28,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 67 [2024-10-12 19:54:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:28,048 INFO L225 Difference]: With dead ends: 6961 [2024-10-12 19:54:28,049 INFO L226 Difference]: Without dead ends: 6958 [2024-10-12 19:54:28,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-10-12 19:54:28,053 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 903 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:28,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 607 Invalid, 1113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 19:54:28,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6958 states. [2024-10-12 19:54:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6958 to 4520. [2024-10-12 19:54:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4520 states, 3429 states have (on average 1.2820064158646836) internal successors, (4396), 3490 states have internal predecessors, (4396), 529 states have call successors, (529), 445 states have call predecessors, (529), 561 states have return successors, (781), 590 states have call predecessors, (781), 528 states have call successors, (781) [2024-10-12 19:54:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4520 states to 4520 states and 5706 transitions. [2024-10-12 19:54:28,726 INFO L78 Accepts]: Start accepts. Automaton has 4520 states and 5706 transitions. Word has length 67 [2024-10-12 19:54:28,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:28,727 INFO L471 AbstractCegarLoop]: Abstraction has 4520 states and 5706 transitions. [2024-10-12 19:54:28,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-12 19:54:28,728 INFO L276 IsEmpty]: Start isEmpty. Operand 4520 states and 5706 transitions. [2024-10-12 19:54:28,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-12 19:54:28,730 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:28,730 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:28,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 19:54:28,933 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,SelfDestructingSolverStorable11 [2024-10-12 19:54:28,933 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:28,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:28,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1152070234, now seen corresponding path program 2 times [2024-10-12 19:54:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:28,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507348345] [2024-10-12 19:54:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:28,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:28,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:28,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:28,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:28,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:28,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:28,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:29,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:29,004 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:54:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:29,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507348345] [2024-10-12 19:54:29,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507348345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:54:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781698267] [2024-10-12 19:54:29,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:29,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:54:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:29,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:54:29,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:54:29,007 INFO L87 Difference]: Start difference. First operand 4520 states and 5706 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-12 19:54:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:29,690 INFO L93 Difference]: Finished difference Result 6976 states and 8835 transitions. [2024-10-12 19:54:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:54:29,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 70 [2024-10-12 19:54:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:29,711 INFO L225 Difference]: With dead ends: 6976 [2024-10-12 19:54:29,712 INFO L226 Difference]: Without dead ends: 3273 [2024-10-12 19:54:29,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:54:29,721 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 246 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:29,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 271 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 19:54:29,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2024-10-12 19:54:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3044. [2024-10-12 19:54:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2309 states have (on average 1.2559549588566479) internal successors, (2900), 2348 states have internal predecessors, (2900), 361 states have call successors, (361), 301 states have call predecessors, (361), 373 states have return successors, (507), 400 states have call predecessors, (507), 360 states have call successors, (507) [2024-10-12 19:54:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 3768 transitions. [2024-10-12 19:54:30,108 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 3768 transitions. Word has length 70 [2024-10-12 19:54:30,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:30,108 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 3768 transitions. [2024-10-12 19:54:30,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-12 19:54:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 3768 transitions. [2024-10-12 19:54:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 19:54:30,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:30,114 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 19:54:30,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:54:30,114 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:30,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:30,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1706112077, now seen corresponding path program 1 times [2024-10-12 19:54:30,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:30,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693163428] [2024-10-12 19:54:30,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:30,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:30,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:30,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:30,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:30,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:30,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:30,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:30,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:30,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:30,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:54:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:54:30,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:30,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693163428] [2024-10-12 19:54:30,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693163428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:30,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:30,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:54:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822651358] [2024-10-12 19:54:30,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:30,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:54:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:30,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:54:30,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:54:30,224 INFO L87 Difference]: Start difference. First operand 3044 states and 3768 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:54:31,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:31,592 INFO L93 Difference]: Finished difference Result 9326 states and 11551 transitions. [2024-10-12 19:54:31,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 19:54:31,593 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2024-10-12 19:54:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:31,621 INFO L225 Difference]: With dead ends: 9326 [2024-10-12 19:54:31,621 INFO L226 Difference]: Without dead ends: 5105 [2024-10-12 19:54:31,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-10-12 19:54:31,633 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 677 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 200 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 200 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:31,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 307 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [200 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:54:31,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5105 states. [2024-10-12 19:54:32,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5105 to 4785. [2024-10-12 19:54:32,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4785 states, 3593 states have (on average 1.239354300027832) internal successors, (4453), 3675 states have internal predecessors, (4453), 565 states have call successors, (565), 475 states have call predecessors, (565), 626 states have return successors, (889), 640 states have call predecessors, (889), 564 states have call successors, (889) [2024-10-12 19:54:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4785 states to 4785 states and 5907 transitions. [2024-10-12 19:54:32,342 INFO L78 Accepts]: Start accepts. Automaton has 4785 states and 5907 transitions. Word has length 75 [2024-10-12 19:54:32,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:32,342 INFO L471 AbstractCegarLoop]: Abstraction has 4785 states and 5907 transitions. [2024-10-12 19:54:32,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:54:32,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4785 states and 5907 transitions. [2024-10-12 19:54:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-12 19:54:32,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:32,346 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-12 19:54:32,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:54:32,346 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:32,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:32,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1385832991, now seen corresponding path program 1 times [2024-10-12 19:54:32,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:32,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542255850] [2024-10-12 19:54:32,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:32,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:32,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:32,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:32,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:32,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:32,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:32,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:32,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:32,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:32,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:54:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:32,472 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-12 19:54:32,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:32,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542255850] [2024-10-12 19:54:32,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542255850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:32,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:32,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:54:32,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250749734] [2024-10-12 19:54:32,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:32,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:54:32,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:32,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:54:32,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:54:32,475 INFO L87 Difference]: Start difference. First operand 4785 states and 5907 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:54:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:33,759 INFO L93 Difference]: Finished difference Result 8456 states and 10398 transitions. [2024-10-12 19:54:33,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-12 19:54:33,760 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 85 [2024-10-12 19:54:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:33,784 INFO L225 Difference]: With dead ends: 8456 [2024-10-12 19:54:33,785 INFO L226 Difference]: Without dead ends: 4276 [2024-10-12 19:54:33,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-10-12 19:54:33,796 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 832 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 853 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:33,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [853 Valid, 441 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:54:33,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2024-10-12 19:54:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 3942. [2024-10-12 19:54:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3942 states, 2963 states have (on average 1.2274721565980424) internal successors, (3637), 3027 states have internal predecessors, (3637), 466 states have call successors, (466), 390 states have call predecessors, (466), 512 states have return successors, (667), 530 states have call predecessors, (667), 465 states have call successors, (667) [2024-10-12 19:54:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 4770 transitions. [2024-10-12 19:54:34,285 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 4770 transitions. Word has length 85 [2024-10-12 19:54:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:34,286 INFO L471 AbstractCegarLoop]: Abstraction has 3942 states and 4770 transitions. [2024-10-12 19:54:34,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-12 19:54:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 4770 transitions. [2024-10-12 19:54:34,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 19:54:34,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:34,295 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:34,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:54:34,296 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:34,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:34,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1071877003, now seen corresponding path program 1 times [2024-10-12 19:54:34,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:34,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930497590] [2024-10-12 19:54:34,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:34,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:54:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:54:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:54:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:54:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:54:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:54:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 19:54:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,458 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-10-12 19:54:34,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:34,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930497590] [2024-10-12 19:54:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930497590] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:54:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123399806] [2024-10-12 19:54:34,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:34,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:34,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:34,463 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:54:34,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 19:54:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:34,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 19:54:34,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:54:34,593 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-12 19:54:34,594 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:54:34,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123399806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:34,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:54:34,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2024-10-12 19:54:34,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046131320] [2024-10-12 19:54:34,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:34,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:54:34,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:34,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:54:34,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:54:34,597 INFO L87 Difference]: Start difference. First operand 3942 states and 4770 transitions. Second operand has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-12 19:54:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:34,847 INFO L93 Difference]: Finished difference Result 5789 states and 7006 transitions. [2024-10-12 19:54:34,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:54:34,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 130 [2024-10-12 19:54:34,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:34,858 INFO L225 Difference]: With dead ends: 5789 [2024-10-12 19:54:34,858 INFO L226 Difference]: Without dead ends: 1873 [2024-10-12 19:54:34,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:54:34,866 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:34,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 543 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:54:34,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2024-10-12 19:54:35,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1873. [2024-10-12 19:54:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1471 states have (on average 1.2107409925220938) internal successors, (1781), 1484 states have internal predecessors, (1781), 190 states have call successors, (190), 156 states have call predecessors, (190), 211 states have return successors, (274), 232 states have call predecessors, (274), 189 states have call successors, (274) [2024-10-12 19:54:35,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2245 transitions. [2024-10-12 19:54:35,071 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2245 transitions. Word has length 130 [2024-10-12 19:54:35,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:35,072 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 2245 transitions. [2024-10-12 19:54:35,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.4) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-12 19:54:35,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2245 transitions. [2024-10-12 19:54:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-12 19:54:35,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:35,077 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:35,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-12 19:54:35,278 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,SelfDestructingSolverStorable15 [2024-10-12 19:54:35,279 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:35,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:35,279 INFO L85 PathProgramCache]: Analyzing trace with hash -11543539, now seen corresponding path program 1 times [2024-10-12 19:54:35,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:35,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333405553] [2024-10-12 19:54:35,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:35,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:35,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:35,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:54:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:54:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:54:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:54:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:54:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:54:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:54:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-10-12 19:54:35,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:35,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333405553] [2024-10-12 19:54:35,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333405553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:35,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:35,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:54:35,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191500660] [2024-10-12 19:54:35,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:35,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:54:35,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:35,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:54:35,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:54:35,352 INFO L87 Difference]: Start difference. First operand 1873 states and 2245 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:54:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:35,686 INFO L93 Difference]: Finished difference Result 1938 states and 2313 transitions. [2024-10-12 19:54:35,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 19:54:35,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 132 [2024-10-12 19:54:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:35,695 INFO L225 Difference]: With dead ends: 1938 [2024-10-12 19:54:35,696 INFO L226 Difference]: Without dead ends: 1536 [2024-10-12 19:54:35,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:54:35,698 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 205 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:35,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 179 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:54:35,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1536 states. [2024-10-12 19:54:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1536 to 1474. [2024-10-12 19:54:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1168 states have (on average 1.216609589041096) internal successors, (1421), 1178 states have internal predecessors, (1421), 144 states have call successors, (144), 116 states have call predecessors, (144), 161 states have return successors, (210), 179 states have call predecessors, (210), 143 states have call successors, (210) [2024-10-12 19:54:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1775 transitions. [2024-10-12 19:54:35,909 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1775 transitions. Word has length 132 [2024-10-12 19:54:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:35,909 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 1775 transitions. [2024-10-12 19:54:35,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 3 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-12 19:54:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1775 transitions. [2024-10-12 19:54:35,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 19:54:35,914 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:35,914 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:35,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:54:35,914 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:35,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:35,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1296350980, now seen corresponding path program 1 times [2024-10-12 19:54:35,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:35,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456424642] [2024-10-12 19:54:35,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:35,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:35,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:35,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:54:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:54:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:54:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:54:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 19:54:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:54:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 19:54:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:36,050 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-10-12 19:54:36,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:36,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456424642] [2024-10-12 19:54:36,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456424642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:36,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:54:36,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:54:36,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696693567] [2024-10-12 19:54:36,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:36,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:54:36,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:36,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:54:36,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:36,052 INFO L87 Difference]: Start difference. First operand 1474 states and 1775 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-12 19:54:36,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:36,561 INFO L93 Difference]: Finished difference Result 2821 states and 3428 transitions. [2024-10-12 19:54:36,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:54:36,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 144 [2024-10-12 19:54:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:36,572 INFO L225 Difference]: With dead ends: 2821 [2024-10-12 19:54:36,573 INFO L226 Difference]: Without dead ends: 1581 [2024-10-12 19:54:36,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:54:36,576 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 181 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:36,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 322 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 19:54:36,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-10-12 19:54:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1399. [2024-10-12 19:54:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1399 states, 1115 states have (on average 1.2161434977578476) internal successors, (1356), 1126 states have internal predecessors, (1356), 135 states have call successors, (135), 111 states have call predecessors, (135), 148 states have return successors, (194), 161 states have call predecessors, (194), 134 states have call successors, (194) [2024-10-12 19:54:36,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1399 states to 1399 states and 1685 transitions. [2024-10-12 19:54:36,813 INFO L78 Accepts]: Start accepts. Automaton has 1399 states and 1685 transitions. Word has length 144 [2024-10-12 19:54:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:36,814 INFO L471 AbstractCegarLoop]: Abstraction has 1399 states and 1685 transitions. [2024-10-12 19:54:36,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-12 19:54:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1399 states and 1685 transitions. [2024-10-12 19:54:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-12 19:54:36,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:36,818 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:36,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:54:36,818 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:36,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1858663312, now seen corresponding path program 1 times [2024-10-12 19:54:36,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:36,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968842903] [2024-10-12 19:54:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:37,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:54:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:54:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:54:37,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:54:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:37,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:54:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:54:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 19:54:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-10-12 19:54:37,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:37,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968842903] [2024-10-12 19:54:37,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968842903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:54:37,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624467084] [2024-10-12 19:54:37,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:37,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:37,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:37,110 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-10-12 19:54:37,113 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-10-12 19:54:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:37,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-12 19:54:37,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:54:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-12 19:54:37,373 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:54:37,614 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-10-12 19:54:37,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624467084] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:54:37,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:54:37,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 5] total 14 [2024-10-12 19:54:37,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025705117] [2024-10-12 19:54:37,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:54:37,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-12 19:54:37,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:37,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-12 19:54:37,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:54:37,616 INFO L87 Difference]: Start difference. First operand 1399 states and 1685 transitions. Second operand has 14 states, 14 states have (on average 15.928571428571429) internal successors, (223), 12 states have internal predecessors, (223), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-12 19:54:38,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:38,496 INFO L93 Difference]: Finished difference Result 3206 states and 3967 transitions. [2024-10-12 19:54:38,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-12 19:54:38,497 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.928571428571429) internal successors, (223), 12 states have internal predecessors, (223), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) Word has length 146 [2024-10-12 19:54:38,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:38,513 INFO L225 Difference]: With dead ends: 3206 [2024-10-12 19:54:38,514 INFO L226 Difference]: Without dead ends: 1904 [2024-10-12 19:54:38,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 324 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2024-10-12 19:54:38,518 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 630 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:38,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 339 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 19:54:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1904 states. [2024-10-12 19:54:38,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1904 to 1760. [2024-10-12 19:54:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1760 states, 1364 states have (on average 1.1979472140762464) internal successors, (1634), 1383 states have internal predecessors, (1634), 189 states have call successors, (189), 161 states have call predecessors, (189), 206 states have return successors, (308), 215 states have call predecessors, (308), 188 states have call successors, (308) [2024-10-12 19:54:38,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 2131 transitions. [2024-10-12 19:54:38,741 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 2131 transitions. Word has length 146 [2024-10-12 19:54:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:38,742 INFO L471 AbstractCegarLoop]: Abstraction has 1760 states and 2131 transitions. [2024-10-12 19:54:38,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.928571428571429) internal successors, (223), 12 states have internal predecessors, (223), 6 states have call successors, (38), 8 states have call predecessors, (38), 10 states have return successors, (35), 6 states have call predecessors, (35), 6 states have call successors, (35) [2024-10-12 19:54:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 2131 transitions. [2024-10-12 19:54:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-12 19:54:38,746 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:38,746 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:38,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-12 19:54:38,950 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-10-12 19:54:38,951 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:38,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:38,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1899535245, now seen corresponding path program 1 times [2024-10-12 19:54:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:38,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040719989] [2024-10-12 19:54:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:54:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-12 19:54:39,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:54:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:54:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:54:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:54:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:54:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:54:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:54:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 19:54:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 19:54:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-12 19:54:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-10-12 19:54:39,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:39,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040719989] [2024-10-12 19:54:39,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040719989] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:54:39,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838582838] [2024-10-12 19:54:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:39,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:39,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:39,070 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-10-12 19:54:39,071 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-10-12 19:54:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:39,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-12 19:54:39,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:54:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-12 19:54:39,212 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:54:39,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838582838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:39,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:54:39,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2024-10-12 19:54:39,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776968955] [2024-10-12 19:54:39,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:39,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:54:39,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:39,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:54:39,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:54:39,214 INFO L87 Difference]: Start difference. First operand 1760 states and 2131 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:54:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:39,572 INFO L93 Difference]: Finished difference Result 3428 states and 4169 transitions. [2024-10-12 19:54:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:54:39,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 161 [2024-10-12 19:54:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:39,586 INFO L225 Difference]: With dead ends: 3428 [2024-10-12 19:54:39,586 INFO L226 Difference]: Without dead ends: 1494 [2024-10-12 19:54:39,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:54:39,591 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 142 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:39,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 206 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:54:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2024-10-12 19:54:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1456. [2024-10-12 19:54:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1137 states have (on average 1.187335092348285) internal successors, (1350), 1149 states have internal predecessors, (1350), 154 states have call successors, (154), 130 states have call predecessors, (154), 164 states have return successors, (234), 176 states have call predecessors, (234), 153 states have call successors, (234) [2024-10-12 19:54:39,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1738 transitions. [2024-10-12 19:54:39,774 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1738 transitions. Word has length 161 [2024-10-12 19:54:39,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:39,774 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 1738 transitions. [2024-10-12 19:54:39,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-12 19:54:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1738 transitions. [2024-10-12 19:54:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-12 19:54:39,778 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:39,779 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:39,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-12 19:54:39,982 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-10-12 19:54:39,983 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:39,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1819492835, now seen corresponding path program 1 times [2024-10-12 19:54:39,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:39,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476592210] [2024-10-12 19:54:39,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:39,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:54:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:54:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:54:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:54:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:54:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:54:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 19:54:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-12 19:54:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-12 19:54:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-10-12 19:54:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-12 19:54:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-10-12 19:54:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-10-12 19:54:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-10-12 19:54:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 67 proven. 6 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-10-12 19:54:40,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476592210] [2024-10-12 19:54:40,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476592210] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:54:40,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095423024] [2024-10-12 19:54:40,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:40,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:40,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:40,121 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-10-12 19:54:40,122 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-10-12 19:54:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:40,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:54:40,243 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:54:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2024-10-12 19:54:40,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:54:40,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095423024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:54:40,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:54:40,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2024-10-12 19:54:40,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392713669] [2024-10-12 19:54:40,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:54:40,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:54:40,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:40,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:54:40,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:40,299 INFO L87 Difference]: Start difference. First operand 1456 states and 1738 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-12 19:54:40,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:40,589 INFO L93 Difference]: Finished difference Result 2799 states and 3391 transitions. [2024-10-12 19:54:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:54:40,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 228 [2024-10-12 19:54:40,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:40,600 INFO L225 Difference]: With dead ends: 2799 [2024-10-12 19:54:40,600 INFO L226 Difference]: Without dead ends: 1431 [2024-10-12 19:54:40,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:54:40,604 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 65 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:40,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 220 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:54:40,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2024-10-12 19:54:40,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1426. [2024-10-12 19:54:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1426 states, 1111 states have (on average 1.171917191719172) internal successors, (1302), 1123 states have internal predecessors, (1302), 154 states have call successors, (154), 130 states have call predecessors, (154), 160 states have return successors, (230), 172 states have call predecessors, (230), 153 states have call successors, (230) [2024-10-12 19:54:40,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1426 states to 1426 states and 1686 transitions. [2024-10-12 19:54:40,785 INFO L78 Accepts]: Start accepts. Automaton has 1426 states and 1686 transitions. Word has length 228 [2024-10-12 19:54:40,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:40,785 INFO L471 AbstractCegarLoop]: Abstraction has 1426 states and 1686 transitions. [2024-10-12 19:54:40,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 3 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-10-12 19:54:40,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1426 states and 1686 transitions. [2024-10-12 19:54:40,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-12 19:54:40,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:54:40,791 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:40,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-12 19:54:40,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:40,992 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:54:40,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:54:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1143729042, now seen corresponding path program 1 times [2024-10-12 19:54:40,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:54:40,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234302640] [2024-10-12 19:54:40,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:40,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:54:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:54:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:54:41,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:54:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:54:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:54:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:54:41,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:54:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:41,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 19:54:41,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 19:54:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-12 19:54:41,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-12 19:54:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-10-12 19:54:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-12 19:54:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-12 19:54:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:54:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:54:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-10-12 19:54:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-12 19:54:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2024-10-12 19:54:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 72 proven. 15 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-10-12 19:54:41,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:54:41,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234302640] [2024-10-12 19:54:41,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234302640] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:54:41,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969246822] [2024-10-12 19:54:41,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:54:41,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:41,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:54:41,197 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-10-12 19:54:41,198 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-10-12 19:54:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:54:41,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:54:41,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:54:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 229 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 19:54:41,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:54:41,674 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 102 proven. 7 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2024-10-12 19:54:41,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969246822] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:54:41,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:54:41,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2024-10-12 19:54:41,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341234971] [2024-10-12 19:54:41,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:54:41,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:54:41,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:54:41,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:54:41,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:54:41,678 INFO L87 Difference]: Start difference. First operand 1426 states and 1686 transitions. Second operand has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2024-10-12 19:54:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:54:42,291 INFO L93 Difference]: Finished difference Result 1757 states and 2058 transitions. [2024-10-12 19:54:42,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:54:42,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) Word has length 229 [2024-10-12 19:54:42,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:54:42,298 INFO L225 Difference]: With dead ends: 1757 [2024-10-12 19:54:42,299 INFO L226 Difference]: Without dead ends: 0 [2024-10-12 19:54:42,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 503 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2024-10-12 19:54:42,303 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 325 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:54:42,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 289 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 19:54:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-12 19:54:42,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-12 19:54:42,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 19:54:42,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-12 19:54:42,307 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 229 [2024-10-12 19:54:42,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:54:42,308 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-12 19:54:42,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 18.727272727272727) internal successors, (206), 8 states have internal predecessors, (206), 4 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (39), 4 states have call predecessors, (39), 4 states have call successors, (39) [2024-10-12 19:54:42,308 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-12 19:54:42,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-12 19:54:42,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-12 19:54:42,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-12 19:54:42,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:54:42,515 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:54:42,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-12 19:54:50,417 WARN L286 SmtUtils]: Spent 6.69s on a formula simplification. DAG size of input: 83 DAG size of output: 42 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-12 19:54:56,976 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification. DAG size of input: 79 DAG size of output: 38 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-12 19:55:09,964 WARN L286 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 94 DAG size of output: 79 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-12 19:55:28,257 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification. DAG size of input: 93 DAG size of output: 71 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-12 19:55:36,451 WARN L286 SmtUtils]: Spent 8.19s on a formula simplification. DAG size of input: 94 DAG size of output: 79 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)