./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.13.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/combinations/pc_sfifo_1.cil-2+token_ring.13.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 0c76345a7418e3e3e542d36688efe541ee3690f4974296017bb3a3a18fafce6e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 21:42:07,923 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 21:42:07,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 21:42:07,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 21:42:07,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 21:42:08,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 21:42:08,011 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 21:42:08,011 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 21:42:08,012 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 21:42:08,012 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 21:42:08,012 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 21:42:08,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 21:42:08,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 21:42:08,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 21:42:08,014 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 21:42:08,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 21:42:08,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 21:42:08,017 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 21:42:08,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 21:42:08,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 21:42:08,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 21:42:08,020 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 21:42:08,020 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 21:42:08,020 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 21:42:08,020 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 21:42:08,020 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 21:42:08,020 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 21:42:08,020 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 21:42:08,021 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 21:42:08,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 21:42:08,021 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 21:42:08,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 21:42:08,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:42:08,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 21:42:08,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 21:42:08,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 21:42:08,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 21:42:08,022 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 21:42:08,022 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 21:42:08,022 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 21:42:08,022 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 21:42:08,023 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 21:42:08,024 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 -> 0c76345a7418e3e3e542d36688efe541ee3690f4974296017bb3a3a18fafce6e [2024-10-12 21:42:08,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 21:42:08,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 21:42:08,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 21:42:08,267 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 21:42:08,267 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 21:42:08,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.13.cil-1.c [2024-10-12 21:42:09,497 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 21:42:09,674 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 21:42:09,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.13.cil-1.c [2024-10-12 21:42:09,703 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69bca2571/64a8d4b8fe9342a8be2f98e8bd3ebbae/FLAG3e6c3c407 [2024-10-12 21:42:10,056 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69bca2571/64a8d4b8fe9342a8be2f98e8bd3ebbae [2024-10-12 21:42:10,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 21:42:10,059 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 21:42:10,060 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 21:42:10,060 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 21:42:10,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 21:42:10,064 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc14517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10, skipping insertion in model container [2024-10-12 21:42:10,065 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 21:42:10,253 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/combinations/pc_sfifo_1.cil-2+token_ring.13.cil-1.c[913,926] [2024-10-12 21:42:10,352 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/combinations/pc_sfifo_1.cil-2+token_ring.13.cil-1.c[5977,5990] [2024-10-12 21:42:10,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:42:10,460 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 21:42:10,472 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/combinations/pc_sfifo_1.cil-2+token_ring.13.cil-1.c[913,926] [2024-10-12 21:42:10,491 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/combinations/pc_sfifo_1.cil-2+token_ring.13.cil-1.c[5977,5990] [2024-10-12 21:42:10,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 21:42:10,547 INFO L204 MainTranslator]: Completed translation [2024-10-12 21:42:10,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10 WrapperNode [2024-10-12 21:42:10,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 21:42:10,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 21:42:10,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 21:42:10,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 21:42:10,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,569 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,612 INFO L138 Inliner]: procedures = 74, calls = 88, calls flagged for inlining = 48, calls inlined = 48, statements flattened = 1149 [2024-10-12 21:42:10,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 21:42:10,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 21:42:10,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 21:42:10,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 21:42:10,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,648 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 21:42:10,649 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,649 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,673 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,676 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,684 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 21:42:10,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 21:42:10,685 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 21:42:10,685 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 21:42:10,685 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (1/1) ... [2024-10-12 21:42:10,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 21:42:10,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:10,727 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 21:42:10,729 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 21:42:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 21:42:10,771 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-12 21:42:10,772 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-12 21:42:10,772 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2024-10-12 21:42:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2024-10-12 21:42:10,773 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-10-12 21:42:10,773 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-10-12 21:42:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-10-12 21:42:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-10-12 21:42:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-10-12 21:42:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-10-12 21:42:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-10-12 21:42:10,774 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-10-12 21:42:10,774 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-10-12 21:42:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-10-12 21:42:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 21:42:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-10-12 21:42:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-10-12 21:42:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 21:42:10,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 21:42:10,775 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-10-12 21:42:10,776 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-10-12 21:42:10,776 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-10-12 21:42:10,776 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-10-12 21:42:10,911 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 21:42:10,913 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 21:42:11,825 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-10-12 21:42:11,825 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 21:42:11,889 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 21:42:11,890 INFO L314 CfgBuilder]: Removed 20 assume(true) statements. [2024-10-12 21:42:11,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:42:11 BoogieIcfgContainer [2024-10-12 21:42:11,892 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 21:42:11,894 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 21:42:11,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 21:42:11,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 21:42:11,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 09:42:10" (1/3) ... [2024-10-12 21:42:11,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f77419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:42:11, skipping insertion in model container [2024-10-12 21:42:11,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 09:42:10" (2/3) ... [2024-10-12 21:42:11,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35f77419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:42:11, skipping insertion in model container [2024-10-12 21:42:11,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:42:11" (3/3) ... [2024-10-12 21:42:11,899 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.13.cil-1.c [2024-10-12 21:42:11,912 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 21:42:11,912 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 21:42:11,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 21:42:11,979 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;@1c926ef6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 21:42:11,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 21:42:11,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 442 states, 394 states have (on average 1.7309644670050761) internal successors, (682), 401 states have internal predecessors, (682), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-12 21:42:11,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 21:42:11,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:11,992 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] [2024-10-12 21:42:11,993 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:11,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:11,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1652009464, now seen corresponding path program 1 times [2024-10-12 21:42:12,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:12,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427469809] [2024-10-12 21:42:12,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:12,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:12,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:12,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:12,240 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 21:42:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:12,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427469809] [2024-10-12 21:42:12,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427469809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:12,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:12,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:12,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175058827] [2024-10-12 21:42:12,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:12,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:12,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:12,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:12,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:12,274 INFO L87 Difference]: Start difference. First operand has 442 states, 394 states have (on average 1.7309644670050761) internal successors, (682), 401 states have internal predecessors, (682), 35 states have call successors, (35), 10 states have call predecessors, (35), 10 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 21:42:12,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:12,957 INFO L93 Difference]: Finished difference Result 868 states and 1472 transitions. [2024-10-12 21:42:12,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:12,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-10-12 21:42:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:12,969 INFO L225 Difference]: With dead ends: 868 [2024-10-12 21:42:12,969 INFO L226 Difference]: Without dead ends: 444 [2024-10-12 21:42:12,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:12,980 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 382 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:12,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 973 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 21:42:12,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-10-12 21:42:13,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 436. [2024-10-12 21:42:13,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 391 states have (on average 1.6214833759590792) internal successors, (634), 395 states have internal predecessors, (634), 35 states have call successors, (35), 10 states have call predecessors, (35), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-12 21:42:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 700 transitions. [2024-10-12 21:42:13,041 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 700 transitions. Word has length 37 [2024-10-12 21:42:13,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:13,042 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 700 transitions. [2024-10-12 21:42:13,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-12 21:42:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 700 transitions. [2024-10-12 21:42:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-12 21:42:13,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:13,046 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] [2024-10-12 21:42:13,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 21:42:13,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:13,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:13,047 INFO L85 PathProgramCache]: Analyzing trace with hash -398974534, now seen corresponding path program 1 times [2024-10-12 21:42:13,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:13,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830446512] [2024-10-12 21:42:13,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:13,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,159 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 21:42:13,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:13,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830446512] [2024-10-12 21:42:13,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830446512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:13,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:13,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200937170] [2024-10-12 21:42:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:13,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:13,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:13,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:13,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:13,167 INFO L87 Difference]: Start difference. First operand 436 states and 700 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:42:13,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:13,643 INFO L93 Difference]: Finished difference Result 555 states and 872 transitions. [2024-10-12 21:42:13,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:13,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2024-10-12 21:42:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:13,646 INFO L225 Difference]: With dead ends: 555 [2024-10-12 21:42:13,648 INFO L226 Difference]: Without dead ends: 499 [2024-10-12 21:42:13,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:13,650 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 950 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:13,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 743 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:42:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2024-10-12 21:42:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 493. [2024-10-12 21:42:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 441 states have (on average 1.5941043083900226) internal successors, (703), 446 states have internal predecessors, (703), 39 states have call successors, (39), 12 states have call predecessors, (39), 11 states have return successors, (41), 35 states have call predecessors, (41), 35 states have call successors, (41) [2024-10-12 21:42:13,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 783 transitions. [2024-10-12 21:42:13,680 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 783 transitions. Word has length 37 [2024-10-12 21:42:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:13,680 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 783 transitions. [2024-10-12 21:42:13,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:42:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 783 transitions. [2024-10-12 21:42:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-12 21:42:13,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:13,682 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] [2024-10-12 21:42:13,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 21:42:13,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:13,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash -637486216, now seen corresponding path program 1 times [2024-10-12 21:42:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:13,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350014802] [2024-10-12 21:42:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:13,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:13,771 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 21:42:13,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:13,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350014802] [2024-10-12 21:42:13,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350014802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:13,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:13,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:13,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581490194] [2024-10-12 21:42:13,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:13,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:13,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:13,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:13,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:13,774 INFO L87 Difference]: Start difference. First operand 493 states and 783 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:42:14,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:14,240 INFO L93 Difference]: Finished difference Result 727 states and 1127 transitions. [2024-10-12 21:42:14,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:14,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2024-10-12 21:42:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:14,243 INFO L225 Difference]: With dead ends: 727 [2024-10-12 21:42:14,243 INFO L226 Difference]: Without dead ends: 616 [2024-10-12 21:42:14,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:14,244 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 968 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:14,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 750 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:42:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2024-10-12 21:42:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 593. [2024-10-12 21:42:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 528 states have (on average 1.5549242424242424) internal successors, (821), 534 states have internal predecessors, (821), 47 states have call successors, (47), 16 states have call predecessors, (47), 16 states have return successors, (55), 43 states have call predecessors, (55), 43 states have call successors, (55) [2024-10-12 21:42:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 923 transitions. [2024-10-12 21:42:14,274 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 923 transitions. Word has length 38 [2024-10-12 21:42:14,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:14,274 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 923 transitions. [2024-10-12 21:42:14,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:42:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 923 transitions. [2024-10-12 21:42:14,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 21:42:14,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:14,276 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] [2024-10-12 21:42:14,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 21:42:14,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:14,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:14,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1990408804, now seen corresponding path program 1 times [2024-10-12 21:42:14,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:14,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750916184] [2024-10-12 21:42:14,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:14,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:14,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-12 21:42:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:14,345 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 21:42:14,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:14,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750916184] [2024-10-12 21:42:14,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750916184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:14,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:14,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:14,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203031509] [2024-10-12 21:42:14,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:14,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:14,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:14,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:14,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:14,349 INFO L87 Difference]: Start difference. First operand 593 states and 923 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:42:14,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:14,877 INFO L93 Difference]: Finished difference Result 1013 states and 1504 transitions. [2024-10-12 21:42:14,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:14,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2024-10-12 21:42:14,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:14,882 INFO L225 Difference]: With dead ends: 1013 [2024-10-12 21:42:14,883 INFO L226 Difference]: Without dead ends: 802 [2024-10-12 21:42:14,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:14,885 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 365 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:14,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1068 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:42:14,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2024-10-12 21:42:14,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 698. [2024-10-12 21:42:14,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 621 states have (on average 1.5297906602254427) internal successors, (950), 629 states have internal predecessors, (950), 53 states have call successors, (53), 22 states have call predecessors, (53), 22 states have return successors, (61), 47 states have call predecessors, (61), 49 states have call successors, (61) [2024-10-12 21:42:14,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1064 transitions. [2024-10-12 21:42:14,929 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1064 transitions. Word has length 39 [2024-10-12 21:42:14,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:14,930 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1064 transitions. [2024-10-12 21:42:14,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-12 21:42:14,930 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1064 transitions. [2024-10-12 21:42:14,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-12 21:42:14,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:14,934 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] [2024-10-12 21:42:14,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 21:42:14,935 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:14,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:14,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1937183733, now seen corresponding path program 1 times [2024-10-12 21:42:14,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:14,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355365255] [2024-10-12 21:42:14,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:14,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:14,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-12 21:42:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:42:15,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,020 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 21:42:15,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:15,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355365255] [2024-10-12 21:42:15,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355365255] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:15,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:15,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:15,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881470244] [2024-10-12 21:42:15,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:15,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:15,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:15,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:15,025 INFO L87 Difference]: Start difference. First operand 698 states and 1064 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:42:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:15,545 INFO L93 Difference]: Finished difference Result 1003 states and 1486 transitions. [2024-10-12 21:42:15,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:15,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 54 [2024-10-12 21:42:15,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:15,549 INFO L225 Difference]: With dead ends: 1003 [2024-10-12 21:42:15,549 INFO L226 Difference]: Without dead ends: 792 [2024-10-12 21:42:15,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:15,551 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 350 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1113 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:15,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1113 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-12 21:42:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2024-10-12 21:42:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 758. [2024-10-12 21:42:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 672 states have (on average 1.5044642857142858) internal successors, (1011), 681 states have internal predecessors, (1011), 58 states have call successors, (58), 25 states have call predecessors, (58), 26 states have return successors, (70), 52 states have call predecessors, (70), 54 states have call successors, (70) [2024-10-12 21:42:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1139 transitions. [2024-10-12 21:42:15,579 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1139 transitions. Word has length 54 [2024-10-12 21:42:15,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:15,579 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1139 transitions. [2024-10-12 21:42:15,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:42:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1139 transitions. [2024-10-12 21:42:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-12 21:42:15,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:15,580 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:42:15,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 21:42:15,581 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:15,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:15,581 INFO L85 PathProgramCache]: Analyzing trace with hash 155537417, now seen corresponding path program 1 times [2024-10-12 21:42:15,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:15,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793847571] [2024-10-12 21:42:15,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:15,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-12 21:42:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 21:42:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-12 21:42:15,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:15,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793847571] [2024-10-12 21:42:15,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793847571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:15,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:15,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:15,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733214473] [2024-10-12 21:42:15,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:15,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:15,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:15,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:15,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:15,631 INFO L87 Difference]: Start difference. First operand 758 states and 1139 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:42:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:16,086 INFO L93 Difference]: Finished difference Result 1247 states and 1799 transitions. [2024-10-12 21:42:16,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:16,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 59 [2024-10-12 21:42:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:16,090 INFO L225 Difference]: With dead ends: 1247 [2024-10-12 21:42:16,091 INFO L226 Difference]: Without dead ends: 912 [2024-10-12 21:42:16,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:16,094 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 954 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:16,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 762 Invalid, 474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:42:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2024-10-12 21:42:16,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 863. [2024-10-12 21:42:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 764 states have (on average 1.4712041884816753) internal successors, (1124), 774 states have internal predecessors, (1124), 65 states have call successors, (65), 30 states have call predecessors, (65), 32 states have return successors, (81), 59 states have call predecessors, (81), 61 states have call successors, (81) [2024-10-12 21:42:16,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1270 transitions. [2024-10-12 21:42:16,134 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1270 transitions. Word has length 59 [2024-10-12 21:42:16,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:16,134 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1270 transitions. [2024-10-12 21:42:16,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:42:16,135 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1270 transitions. [2024-10-12 21:42:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:42:16,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:16,137 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] [2024-10-12 21:42:16,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 21:42:16,137 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:16,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:16,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1582269146, now seen corresponding path program 1 times [2024-10-12 21:42:16,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:16,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024631245] [2024-10-12 21:42:16,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:16,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:16,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-12 21:42:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:16,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024631245] [2024-10-12 21:42:16,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024631245] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:42:16,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701894302] [2024-10-12 21:42:16,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:16,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:16,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:16,218 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 21:42:16,220 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 21:42:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 21:42:16,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:42:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:42:16,342 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:42:16,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701894302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:16,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:42:16,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 21:42:16,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629564169] [2024-10-12 21:42:16,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:16,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:42:16,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:16,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:42:16,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:42:16,344 INFO L87 Difference]: Start difference. First operand 863 states and 1270 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:42:16,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:16,443 INFO L93 Difference]: Finished difference Result 1256 states and 1815 transitions. [2024-10-12 21:42:16,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:42:16,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-12 21:42:16,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:16,449 INFO L225 Difference]: With dead ends: 1256 [2024-10-12 21:42:16,449 INFO L226 Difference]: Without dead ends: 861 [2024-10-12 21:42:16,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:42:16,452 INFO L432 NwaCegarLoop]: 687 mSDtfsCounter, 66 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1309 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:16,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1309 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:42:16,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-12 21:42:16,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 823. [2024-10-12 21:42:16,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 730 states have (on average 1.463013698630137) internal successors, (1068), 740 states have internal predecessors, (1068), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (75), 55 states have call predecessors, (75), 57 states have call successors, (75) [2024-10-12 21:42:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1204 transitions. [2024-10-12 21:42:16,486 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1204 transitions. Word has length 60 [2024-10-12 21:42:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:16,486 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1204 transitions. [2024-10-12 21:42:16,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:42:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1204 transitions. [2024-10-12 21:42:16,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:42:16,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:16,489 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:42:16,509 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 21:42:16,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:16,690 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:16,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:16,690 INFO L85 PathProgramCache]: Analyzing trace with hash -511845467, now seen corresponding path program 1 times [2024-10-12 21:42:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:16,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905557369] [2024-10-12 21:42:16,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:16,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:16,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:16,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:42:16,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905557369] [2024-10-12 21:42:16,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905557369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:42:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460585120] [2024-10-12 21:42:16,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:16,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:16,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:16,793 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 21:42:16,795 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 21:42:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:16,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:42:16,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:42:16,908 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 21:42:16,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:42:16,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460585120] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:16,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:42:16,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:42:16,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728376884] [2024-10-12 21:42:16,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:16,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:16,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:16,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:16,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:16,913 INFO L87 Difference]: Start difference. First operand 823 states and 1204 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:42:17,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:17,030 INFO L93 Difference]: Finished difference Result 1184 states and 1696 transitions. [2024-10-12 21:42:17,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:42:17,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-12 21:42:17,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:17,033 INFO L225 Difference]: With dead ends: 1184 [2024-10-12 21:42:17,033 INFO L226 Difference]: Without dead ends: 831 [2024-10-12 21:42:17,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:17,038 INFO L432 NwaCegarLoop]: 644 mSDtfsCounter, 0 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:17,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1927 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:42:17,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-10-12 21:42:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 831. [2024-10-12 21:42:17,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 738 states have (on average 1.4498644986449865) internal successors, (1070), 748 states have internal predecessors, (1070), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (75), 55 states have call predecessors, (75), 57 states have call successors, (75) [2024-10-12 21:42:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1206 transitions. [2024-10-12 21:42:17,064 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1206 transitions. Word has length 60 [2024-10-12 21:42:17,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:17,064 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1206 transitions. [2024-10-12 21:42:17,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:42:17,065 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1206 transitions. [2024-10-12 21:42:17,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:42:17,066 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:17,066 INFO L215 NwaCegarLoop]: trace histogram [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 21:42:17,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 21:42:17,266 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,SelfDestructingSolverStorable7 [2024-10-12 21:42:17,267 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:17,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:17,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1355850969, now seen corresponding path program 1 times [2024-10-12 21:42:17,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:17,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943846894] [2024-10-12 21:42:17,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:17,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,352 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 21:42:17,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:17,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943846894] [2024-10-12 21:42:17,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943846894] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:42:17,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [686830563] [2024-10-12 21:42:17,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:17,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:17,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:17,354 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 21:42:17,356 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 21:42:17,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-12 21:42:17,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:42:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 21:42:17,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:42:17,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [686830563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:17,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:42:17,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-10-12 21:42:17,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611877337] [2024-10-12 21:42:17,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:17,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:17,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:17,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:17,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:17,452 INFO L87 Difference]: Start difference. First operand 831 states and 1206 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:42:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:17,568 INFO L93 Difference]: Finished difference Result 1190 states and 1686 transitions. [2024-10-12 21:42:17,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 21:42:17,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 60 [2024-10-12 21:42:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:17,572 INFO L225 Difference]: With dead ends: 1190 [2024-10-12 21:42:17,572 INFO L226 Difference]: Without dead ends: 847 [2024-10-12 21:42:17,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:17,574 INFO L432 NwaCegarLoop]: 644 mSDtfsCounter, 0 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:17,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1927 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:42:17,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-10-12 21:42:17,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 847. [2024-10-12 21:42:17,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 847 states, 754 states have (on average 1.43368700265252) internal successors, (1081), 764 states have internal predecessors, (1081), 61 states have call successors, (61), 28 states have call predecessors, (61), 30 states have return successors, (74), 55 states have call predecessors, (74), 57 states have call successors, (74) [2024-10-12 21:42:17,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 1216 transitions. [2024-10-12 21:42:17,601 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 1216 transitions. Word has length 60 [2024-10-12 21:42:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:17,603 INFO L471 AbstractCegarLoop]: Abstraction has 847 states and 1216 transitions. [2024-10-12 21:42:17,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-12 21:42:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 1216 transitions. [2024-10-12 21:42:17,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-12 21:42:17,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:17,605 INFO L215 NwaCegarLoop]: trace histogram [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 21:42:17,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 21:42:17,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:17,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:17,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:17,806 INFO L85 PathProgramCache]: Analyzing trace with hash 441788647, now seen corresponding path program 1 times [2024-10-12 21:42:17,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:17,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811646336] [2024-10-12 21:42:17,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:17,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:42:17,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:17,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811646336] [2024-10-12 21:42:17,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811646336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:17,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:17,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:42:17,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634271274] [2024-10-12 21:42:17,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:17,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:42:17,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:17,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:42:17,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:17,882 INFO L87 Difference]: Start difference. First operand 847 states and 1216 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:42:18,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:18,378 INFO L93 Difference]: Finished difference Result 928 states and 1313 transitions. [2024-10-12 21:42:18,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:42:18,379 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 60 [2024-10-12 21:42:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:18,383 INFO L225 Difference]: With dead ends: 928 [2024-10-12 21:42:18,383 INFO L226 Difference]: Without dead ends: 925 [2024-10-12 21:42:18,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:42:18,383 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 1591 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:18,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 753 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:42:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2024-10-12 21:42:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 846. [2024-10-12 21:42:18,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 754 states have (on average 1.4310344827586208) internal successors, (1079), 763 states have internal predecessors, (1079), 60 states have call successors, (60), 28 states have call predecessors, (60), 30 states have return successors, (74), 55 states have call predecessors, (74), 57 states have call successors, (74) [2024-10-12 21:42:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1213 transitions. [2024-10-12 21:42:18,411 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1213 transitions. Word has length 60 [2024-10-12 21:42:18,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:18,412 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1213 transitions. [2024-10-12 21:42:18,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-12 21:42:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1213 transitions. [2024-10-12 21:42:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-12 21:42:18,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:18,413 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-12 21:42:18,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 21:42:18,413 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:18,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:18,413 INFO L85 PathProgramCache]: Analyzing trace with hash 809038442, now seen corresponding path program 1 times [2024-10-12 21:42:18,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:18,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707805669] [2024-10-12 21:42:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:18,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:18,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:18,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:18,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 21:42:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:42:18,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:18,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707805669] [2024-10-12 21:42:18,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707805669] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:42:18,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952278535] [2024-10-12 21:42:18,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:18,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:18,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:18,537 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 21:42:18,541 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 21:42:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:18,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-12 21:42:18,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:42:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 21:42:18,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 21:42:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-12 21:42:18,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952278535] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 21:42:18,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 21:42:18,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2024-10-12 21:42:18,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96628705] [2024-10-12 21:42:18,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 21:42:18,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 21:42:18,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:18,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 21:42:18,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:42:18,897 INFO L87 Difference]: Start difference. First operand 846 states and 1213 transitions. Second operand has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 21:42:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:19,796 INFO L93 Difference]: Finished difference Result 1521 states and 2063 transitions. [2024-10-12 21:42:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-12 21:42:19,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 61 [2024-10-12 21:42:19,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:19,802 INFO L225 Difference]: With dead ends: 1521 [2024-10-12 21:42:19,802 INFO L226 Difference]: Without dead ends: 1518 [2024-10-12 21:42:19,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-12 21:42:19,803 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1130 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 1725 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 2013 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:19,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 2013 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1725 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-12 21:42:19,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-10-12 21:42:19,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1139. [2024-10-12 21:42:19,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1139 states, 1011 states have (on average 1.387734915924827) internal successors, (1403), 1026 states have internal predecessors, (1403), 79 states have call successors, (79), 41 states have call predecessors, (79), 47 states have return successors, (104), 72 states have call predecessors, (104), 76 states have call successors, (104) [2024-10-12 21:42:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 1586 transitions. [2024-10-12 21:42:19,851 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 1586 transitions. Word has length 61 [2024-10-12 21:42:19,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:19,853 INFO L471 AbstractCegarLoop]: Abstraction has 1139 states and 1586 transitions. [2024-10-12 21:42:19,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.5) internal successors, (100), 7 states have internal predecessors, (100), 6 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-12 21:42:19,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 1586 transitions. [2024-10-12 21:42:19,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 21:42:19,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:19,855 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-12 21:42:19,868 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 21:42:20,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:20,055 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:20,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:20,056 INFO L85 PathProgramCache]: Analyzing trace with hash -969139261, now seen corresponding path program 2 times [2024-10-12 21:42:20,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:20,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594207357] [2024-10-12 21:42:20,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 21:42:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 21:42:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,097 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 21:42:20,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:20,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594207357] [2024-10-12 21:42:20,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594207357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:20,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:20,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 21:42:20,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747390176] [2024-10-12 21:42:20,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:20,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 21:42:20,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:20,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 21:42:20,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 21:42:20,098 INFO L87 Difference]: Start difference. First operand 1139 states and 1586 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 21:42:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:20,525 INFO L93 Difference]: Finished difference Result 1735 states and 2343 transitions. [2024-10-12 21:42:20,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 21:42:20,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2024-10-12 21:42:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:20,530 INFO L225 Difference]: With dead ends: 1735 [2024-10-12 21:42:20,530 INFO L226 Difference]: Without dead ends: 1146 [2024-10-12 21:42:20,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:20,533 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 965 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:20,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 773 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 21:42:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2024-10-12 21:42:20,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1075. [2024-10-12 21:42:20,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 954 states have (on average 1.3867924528301887) internal successors, (1323), 969 states have internal predecessors, (1323), 76 states have call successors, (76), 38 states have call predecessors, (76), 43 states have return successors, (99), 68 states have call predecessors, (99), 73 states have call successors, (99) [2024-10-12 21:42:20,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1498 transitions. [2024-10-12 21:42:20,602 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1498 transitions. Word has length 78 [2024-10-12 21:42:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:20,602 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1498 transitions. [2024-10-12 21:42:20,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-12 21:42:20,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1498 transitions. [2024-10-12 21:42:20,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-12 21:42:20,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:20,605 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 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 21:42:20,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 21:42:20,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:20,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash 827307527, now seen corresponding path program 1 times [2024-10-12 21:42:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860680672] [2024-10-12 21:42:20,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:20,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 21:42:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 21:42:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 21:42:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 21:42:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 21:42:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,679 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-12 21:42:20,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:20,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860680672] [2024-10-12 21:42:20,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860680672] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 21:42:20,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236934172] [2024-10-12 21:42:20,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:20,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 21:42:20,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 21:42:20,682 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 21:42:20,683 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 21:42:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:20,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 21:42:20,777 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 21:42:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 21:42:20,796 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 21:42:20,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236934172] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:20,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 21:42:20,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-12 21:42:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885392755] [2024-10-12 21:42:20,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:20,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 21:42:20,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:20,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 21:42:20,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:42:20,797 INFO L87 Difference]: Start difference. First operand 1075 states and 1498 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 21:42:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:20,895 INFO L93 Difference]: Finished difference Result 1356 states and 1847 transitions. [2024-10-12 21:42:20,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 21:42:20,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 92 [2024-10-12 21:42:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:20,898 INFO L225 Difference]: With dead ends: 1356 [2024-10-12 21:42:20,898 INFO L226 Difference]: Without dead ends: 377 [2024-10-12 21:42:20,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:42:20,900 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 54 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:20,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1301 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 21:42:20,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-10-12 21:42:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-10-12 21:42:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 341 states have (on average 1.6422287390029326) internal successors, (560), 343 states have internal predecessors, (560), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:42:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 616 transitions. [2024-10-12 21:42:20,912 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 616 transitions. Word has length 92 [2024-10-12 21:42:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:20,912 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 616 transitions. [2024-10-12 21:42:20,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2024-10-12 21:42:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 616 transitions. [2024-10-12 21:42:20,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:20,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:20,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:20,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-12 21:42:21,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-12 21:42:21,115 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:21,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:21,115 INFO L85 PathProgramCache]: Analyzing trace with hash -999009792, now seen corresponding path program 1 times [2024-10-12 21:42:21,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:21,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80063112] [2024-10-12 21:42:21,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:21,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:21,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:21,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:21,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:21,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:21,302 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 21:42:21,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:21,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80063112] [2024-10-12 21:42:21,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80063112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:21,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:21,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:42:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391799128] [2024-10-12 21:42:21,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:21,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:42:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:21,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:42:21,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:21,304 INFO L87 Difference]: Start difference. First operand 377 states and 616 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:22,762 INFO L93 Difference]: Finished difference Result 887 states and 1472 transitions. [2024-10-12 21:42:22,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:42:22,763 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:22,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:22,765 INFO L225 Difference]: With dead ends: 887 [2024-10-12 21:42:22,765 INFO L226 Difference]: Without dead ends: 517 [2024-10-12 21:42:22,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:42:22,766 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 1060 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:22,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 692 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-12 21:42:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-10-12 21:42:22,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 377. [2024-10-12 21:42:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 341 states have (on average 1.6392961876832846) internal successors, (559), 343 states have internal predecessors, (559), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:42:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 615 transitions. [2024-10-12 21:42:22,784 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 615 transitions. Word has length 172 [2024-10-12 21:42:22,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:22,784 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 615 transitions. [2024-10-12 21:42:22,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:22,785 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 615 transitions. [2024-10-12 21:42:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:22,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:22,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 21:42:22,786 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:22,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash 725598530, now seen corresponding path program 1 times [2024-10-12 21:42:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:22,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40810690] [2024-10-12 21:42:22,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:22,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:22,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:22,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:22,966 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 21:42:22,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:22,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40810690] [2024-10-12 21:42:22,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40810690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:22,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:22,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 21:42:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023461087] [2024-10-12 21:42:22,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:22,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 21:42:22,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:22,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 21:42:22,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 21:42:22,968 INFO L87 Difference]: Start difference. First operand 377 states and 615 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:24,286 INFO L93 Difference]: Finished difference Result 879 states and 1455 transitions. [2024-10-12 21:42:24,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-12 21:42:24,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:24,289 INFO L225 Difference]: With dead ends: 879 [2024-10-12 21:42:24,289 INFO L226 Difference]: Without dead ends: 517 [2024-10-12 21:42:24,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-12 21:42:24,291 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1051 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:24,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 690 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 21:42:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2024-10-12 21:42:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 377. [2024-10-12 21:42:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 341 states have (on average 1.6363636363636365) internal successors, (558), 343 states have internal predecessors, (558), 29 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-12 21:42:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 614 transitions. [2024-10-12 21:42:24,308 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 614 transitions. Word has length 172 [2024-10-12 21:42:24,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:24,309 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 614 transitions. [2024-10-12 21:42:24,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 3 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 614 transitions. [2024-10-12 21:42:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:24,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:24,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:24,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 21:42:24,310 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:24,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:24,311 INFO L85 PathProgramCache]: Analyzing trace with hash -255356284, now seen corresponding path program 1 times [2024-10-12 21:42:24,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:24,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338958253] [2024-10-12 21:42:24,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:24,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:24,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:24,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:24,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:24,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:24,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:24,553 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 21:42:24,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:24,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338958253] [2024-10-12 21:42:24,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338958253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:24,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:24,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 21:42:24,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495666723] [2024-10-12 21:42:24,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:24,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 21:42:24,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:24,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 21:42:24,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 21:42:24,555 INFO L87 Difference]: Start difference. First operand 377 states and 614 transitions. Second operand has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:26,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:26,903 INFO L93 Difference]: Finished difference Result 1392 states and 2318 transitions. [2024-10-12 21:42:26,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 21:42:26,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:26,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:26,907 INFO L225 Difference]: With dead ends: 1392 [2024-10-12 21:42:26,908 INFO L226 Difference]: Without dead ends: 1035 [2024-10-12 21:42:26,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:26,909 INFO L432 NwaCegarLoop]: 292 mSDtfsCounter, 1601 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 2471 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1621 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 2591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:26,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1621 Valid, 1167 Invalid, 2591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2471 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-12 21:42:26,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-10-12 21:42:26,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 754. [2024-10-12 21:42:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 689 states have (on average 1.6473149492017416) internal successors, (1135), 692 states have internal predecessors, (1135), 51 states have call successors, (51), 13 states have call predecessors, (51), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2024-10-12 21:42:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1238 transitions. [2024-10-12 21:42:26,959 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1238 transitions. Word has length 172 [2024-10-12 21:42:26,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:26,959 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1238 transitions. [2024-10-12 21:42:26,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.833333333333332) internal successors, (161), 4 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:26,959 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1238 transitions. [2024-10-12 21:42:26,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:26,960 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:26,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:26,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 21:42:26,961 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:26,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:26,962 INFO L85 PathProgramCache]: Analyzing trace with hash 749748992, now seen corresponding path program 1 times [2024-10-12 21:42:26,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:26,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538273224] [2024-10-12 21:42:26,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:26,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:27,207 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 21:42:27,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:27,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538273224] [2024-10-12 21:42:27,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538273224] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:27,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:27,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:27,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542837138] [2024-10-12 21:42:27,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:27,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:27,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:27,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:27,209 INFO L87 Difference]: Start difference. First operand 754 states and 1238 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:30,418 INFO L93 Difference]: Finished difference Result 2307 states and 3848 transitions. [2024-10-12 21:42:30,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:30,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:30,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:30,424 INFO L225 Difference]: With dead ends: 2307 [2024-10-12 21:42:30,424 INFO L226 Difference]: Without dead ends: 1573 [2024-10-12 21:42:30,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:30,428 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 1638 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 4019 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1658 SdHoareTripleChecker+Valid, 2232 SdHoareTripleChecker+Invalid, 4086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 4019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:30,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1658 Valid, 2232 Invalid, 4086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 4019 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:42:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2024-10-12 21:42:30,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1102. [2024-10-12 21:42:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1008 states have (on average 1.6408730158730158) internal successors, (1654), 1012 states have internal predecessors, (1654), 73 states have call successors, (73), 19 states have call predecessors, (73), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2024-10-12 21:42:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1803 transitions. [2024-10-12 21:42:30,482 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1803 transitions. Word has length 172 [2024-10-12 21:42:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:30,482 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1803 transitions. [2024-10-12 21:42:30,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:30,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1803 transitions. [2024-10-12 21:42:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:30,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:30,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:30,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 21:42:30,484 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:30,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:30,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1135611394, now seen corresponding path program 1 times [2024-10-12 21:42:30,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:30,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908658553] [2024-10-12 21:42:30,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:30,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:30,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:30,735 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 21:42:30,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:30,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908658553] [2024-10-12 21:42:30,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908658553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:30,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:30,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:30,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348219521] [2024-10-12 21:42:30,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:30,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:30,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:30,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:30,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:30,736 INFO L87 Difference]: Start difference. First operand 1102 states and 1803 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:34,079 INFO L93 Difference]: Finished difference Result 3648 states and 6075 transitions. [2024-10-12 21:42:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:34,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:34,091 INFO L225 Difference]: With dead ends: 3648 [2024-10-12 21:42:34,092 INFO L226 Difference]: Without dead ends: 2566 [2024-10-12 21:42:34,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:34,098 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 1636 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 4015 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 4084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 4015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:34,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 2230 Invalid, 4084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 4015 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 21:42:34,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2024-10-12 21:42:34,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 1799. [2024-10-12 21:42:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1647 states have (on average 1.6350941105039465) internal successors, (2693), 1653 states have internal predecessors, (2693), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-12 21:42:34,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2938 transitions. [2024-10-12 21:42:34,194 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2938 transitions. Word has length 172 [2024-10-12 21:42:34,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:34,194 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2938 transitions. [2024-10-12 21:42:34,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2938 transitions. [2024-10-12 21:42:34,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:34,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:34,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:34,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 21:42:34,196 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:34,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:34,197 INFO L85 PathProgramCache]: Analyzing trace with hash 870963904, now seen corresponding path program 1 times [2024-10-12 21:42:34,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:34,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158059007] [2024-10-12 21:42:34,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:34,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:34,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:34,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:34,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:34,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:34,418 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 21:42:34,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:34,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158059007] [2024-10-12 21:42:34,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158059007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:34,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:34,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:34,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256856989] [2024-10-12 21:42:34,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:34,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:34,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:34,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:34,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:34,420 INFO L87 Difference]: Start difference. First operand 1799 states and 2938 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:35,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:35,829 INFO L93 Difference]: Finished difference Result 4333 states and 7201 transitions. [2024-10-12 21:42:35,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:35,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:35,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:35,837 INFO L225 Difference]: With dead ends: 4333 [2024-10-12 21:42:35,837 INFO L226 Difference]: Without dead ends: 2554 [2024-10-12 21:42:35,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:35,841 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 1437 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:35,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 959 Invalid, 1849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:42:35,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2024-10-12 21:42:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 1799. [2024-10-12 21:42:35,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1647 states have (on average 1.6320582877959928) internal successors, (2688), 1653 states have internal predecessors, (2688), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-12 21:42:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2933 transitions. [2024-10-12 21:42:35,938 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2933 transitions. Word has length 172 [2024-10-12 21:42:35,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:35,939 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2933 transitions. [2024-10-12 21:42:35,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2933 transitions. [2024-10-12 21:42:35,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:35,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:35,940 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:35,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 21:42:35,941 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:35,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:35,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1492877758, now seen corresponding path program 1 times [2024-10-12 21:42:35,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:35,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618592213] [2024-10-12 21:42:35,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:35,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:35,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:36,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:36,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:36,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:36,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:36,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:36,234 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 21:42:36,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:36,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618592213] [2024-10-12 21:42:36,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618592213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:36,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:36,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:36,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062126212] [2024-10-12 21:42:36,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:36,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:36,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:36,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:36,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:36,238 INFO L87 Difference]: Start difference. First operand 1799 states and 2933 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:37,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:37,662 INFO L93 Difference]: Finished difference Result 4322 states and 7165 transitions. [2024-10-12 21:42:37,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:37,662 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:37,671 INFO L225 Difference]: With dead ends: 4322 [2024-10-12 21:42:37,671 INFO L226 Difference]: Without dead ends: 2543 [2024-10-12 21:42:37,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:37,676 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1335 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1829 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:37,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 960 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1829 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:42:37,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2024-10-12 21:42:37,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 1799. [2024-10-12 21:42:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1799 states, 1647 states have (on average 1.629022465088039) internal successors, (2683), 1653 states have internal predecessors, (2683), 117 states have call successors, (117), 31 states have call predecessors, (117), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2024-10-12 21:42:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2928 transitions. [2024-10-12 21:42:37,796 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2928 transitions. Word has length 172 [2024-10-12 21:42:37,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:37,797 INFO L471 AbstractCegarLoop]: Abstraction has 1799 states and 2928 transitions. [2024-10-12 21:42:37,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:37,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2928 transitions. [2024-10-12 21:42:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:37,798 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:37,798 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:37,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 21:42:37,799 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:37,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash 404101700, now seen corresponding path program 1 times [2024-10-12 21:42:37,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:37,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647308282] [2024-10-12 21:42:37,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:37,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:37,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:37,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:37,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:38,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:38,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:38,023 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 21:42:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647308282] [2024-10-12 21:42:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647308282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:38,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:38,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:38,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366666282] [2024-10-12 21:42:38,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:38,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:38,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:38,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:38,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:38,025 INFO L87 Difference]: Start difference. First operand 1799 states and 2928 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:41,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:41,589 INFO L93 Difference]: Finished difference Result 6200 states and 10240 transitions. [2024-10-12 21:42:41,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:41,590 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:41,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:41,606 INFO L225 Difference]: With dead ends: 6200 [2024-10-12 21:42:41,607 INFO L226 Difference]: Without dead ends: 4421 [2024-10-12 21:42:41,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:41,611 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 1623 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 3933 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 4002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:41,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1643 Valid, 2230 Invalid, 4002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3933 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 21:42:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4421 states. [2024-10-12 21:42:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4421 to 3208. [2024-10-12 21:42:41,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 2940 states have (on average 1.6238095238095238) internal successors, (4774), 2950 states have internal predecessors, (4774), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-12 21:42:41,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 5217 transitions. [2024-10-12 21:42:41,826 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 5217 transitions. Word has length 172 [2024-10-12 21:42:41,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:41,827 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 5217 transitions. [2024-10-12 21:42:41,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 5217 transitions. [2024-10-12 21:42:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:41,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:41,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:41,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 21:42:41,829 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:41,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash 742389250, now seen corresponding path program 1 times [2024-10-12 21:42:41,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:41,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147216329] [2024-10-12 21:42:41,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:41,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:41,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:41,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:42,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:42,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:42,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:42,076 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 21:42:42,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:42,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147216329] [2024-10-12 21:42:42,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147216329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:42,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:42,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521375465] [2024-10-12 21:42:42,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:42,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:42,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:42,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:42,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:42,078 INFO L87 Difference]: Start difference. First operand 3208 states and 5217 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:43,658 INFO L93 Difference]: Finished difference Result 7636 states and 12610 transitions. [2024-10-12 21:42:43,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:42:43,660 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:43,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:43,674 INFO L225 Difference]: With dead ends: 7636 [2024-10-12 21:42:43,674 INFO L226 Difference]: Without dead ends: 4448 [2024-10-12 21:42:43,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:42:43,682 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 1334 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 1907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:43,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 960 Invalid, 1907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:42:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2024-10-12 21:42:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 3208. [2024-10-12 21:42:43,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3208 states, 2940 states have (on average 1.620748299319728) internal successors, (4765), 2950 states have internal predecessors, (4765), 205 states have call successors, (205), 55 states have call predecessors, (205), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2024-10-12 21:42:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 5208 transitions. [2024-10-12 21:42:43,898 INFO L78 Accepts]: Start accepts. Automaton has 3208 states and 5208 transitions. Word has length 172 [2024-10-12 21:42:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:43,899 INFO L471 AbstractCegarLoop]: Abstraction has 3208 states and 5208 transitions. [2024-10-12 21:42:43,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:43,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3208 states and 5208 transitions. [2024-10-12 21:42:43,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:43,901 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:43,901 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:43,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-12 21:42:43,902 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:43,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1168943748, now seen corresponding path program 1 times [2024-10-12 21:42:43,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:43,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820334990] [2024-10-12 21:42:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:43,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:44,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:44,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:44,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:44,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:44,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:44,114 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 21:42:44,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:44,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820334990] [2024-10-12 21:42:44,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820334990] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:44,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:44,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:44,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151109765] [2024-10-12 21:42:44,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:44,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:44,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:44,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:44,118 INFO L87 Difference]: Start difference. First operand 3208 states and 5208 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:47,493 INFO L93 Difference]: Finished difference Result 11331 states and 18641 transitions. [2024-10-12 21:42:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:47,494 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:47,519 INFO L225 Difference]: With dead ends: 11331 [2024-10-12 21:42:47,519 INFO L226 Difference]: Without dead ends: 8143 [2024-10-12 21:42:47,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:47,529 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 1615 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 3895 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 3964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:47,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 2230 Invalid, 3964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3895 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:42:47,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8143 states. [2024-10-12 21:42:47,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8143 to 6036. [2024-10-12 21:42:47,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6036 states, 5536 states have (on average 1.6161488439306357) internal successors, (8947), 5554 states have internal predecessors, (8947), 381 states have call successors, (381), 103 states have call predecessors, (381), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2024-10-12 21:42:47,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6036 states to 6036 states and 9804 transitions. [2024-10-12 21:42:47,957 INFO L78 Accepts]: Start accepts. Automaton has 6036 states and 9804 transitions. Word has length 172 [2024-10-12 21:42:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:47,957 INFO L471 AbstractCegarLoop]: Abstraction has 6036 states and 9804 transitions. [2024-10-12 21:42:47,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 6036 states and 9804 transitions. [2024-10-12 21:42:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:47,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:47,961 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:47,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-12 21:42:47,961 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:47,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash 628514242, now seen corresponding path program 1 times [2024-10-12 21:42:47,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:47,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155789286] [2024-10-12 21:42:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:47,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:48,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:48,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:48,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:48,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:48,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:48,161 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 21:42:48,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:48,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155789286] [2024-10-12 21:42:48,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155789286] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:48,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:48,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:48,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075504666] [2024-10-12 21:42:48,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:48,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:48,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:48,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:48,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:48,163 INFO L87 Difference]: Start difference. First operand 6036 states and 9804 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:51,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:51,821 INFO L93 Difference]: Finished difference Result 21609 states and 35575 transitions. [2024-10-12 21:42:51,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:51,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:51,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:51,859 INFO L225 Difference]: With dead ends: 21609 [2024-10-12 21:42:51,859 INFO L226 Difference]: Without dead ends: 15593 [2024-10-12 21:42:51,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:51,875 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 1614 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 3882 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1634 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 3951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:51,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1634 Valid, 2230 Invalid, 3951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3882 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 21:42:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15593 states. [2024-10-12 21:42:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15593 to 11705. [2024-10-12 21:42:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11705 states, 10741 states have (on average 1.6133507122241877) internal successors, (17329), 10775 states have internal predecessors, (17329), 733 states have call successors, (733), 199 states have call predecessors, (733), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2024-10-12 21:42:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11705 states to 11705 states and 19068 transitions. [2024-10-12 21:42:52,620 INFO L78 Accepts]: Start accepts. Automaton has 11705 states and 19068 transitions. Word has length 172 [2024-10-12 21:42:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:52,621 INFO L471 AbstractCegarLoop]: Abstraction has 11705 states and 19068 transitions. [2024-10-12 21:42:52,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 11705 states and 19068 transitions. [2024-10-12 21:42:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:52,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:52,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:52,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-12 21:42:52,627 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:52,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:52,628 INFO L85 PathProgramCache]: Analyzing trace with hash 472533700, now seen corresponding path program 1 times [2024-10-12 21:42:52,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:52,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769110752] [2024-10-12 21:42:52,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:52,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:52,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:52,837 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 21:42:52,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:52,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769110752] [2024-10-12 21:42:52,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769110752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:52,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:52,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:52,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057257268] [2024-10-12 21:42:52,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:52,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:52,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:52,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:52,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:52,840 INFO L87 Difference]: Start difference. First operand 11705 states and 19068 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:57,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:42:57,526 INFO L93 Difference]: Finished difference Result 42164 states and 69633 transitions. [2024-10-12 21:42:57,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:42:57,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:42:57,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:42:57,603 INFO L225 Difference]: With dead ends: 42164 [2024-10-12 21:42:57,604 INFO L226 Difference]: Without dead ends: 30479 [2024-10-12 21:42:57,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:42:57,632 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 1613 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 3869 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1633 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 3938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 21:42:57,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1633 Valid, 2230 Invalid, 3938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3869 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 21:42:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30479 states. [2024-10-12 21:42:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30479 to 23074. [2024-10-12 21:42:59,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23074 states, 21182 states have (on average 1.6116986120290813) internal successors, (34139), 21248 states have internal predecessors, (34139), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-10-12 21:42:59,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23074 states to 23074 states and 37804 transitions. [2024-10-12 21:42:59,362 INFO L78 Accepts]: Start accepts. Automaton has 23074 states and 37804 transitions. Word has length 172 [2024-10-12 21:42:59,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:42:59,362 INFO L471 AbstractCegarLoop]: Abstraction has 23074 states and 37804 transitions. [2024-10-12 21:42:59,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:42:59,362 INFO L276 IsEmpty]: Start isEmpty. Operand 23074 states and 37804 transitions. [2024-10-12 21:42:59,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:42:59,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:42:59,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:59,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-12 21:42:59,376 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:42:59,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:42:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash 883144066, now seen corresponding path program 1 times [2024-10-12 21:42:59,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:42:59,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336645288] [2024-10-12 21:42:59,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:42:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:42:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:59,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:42:59,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:59,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:42:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:59,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:42:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:59,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:42:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:59,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:42:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:42:59,612 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 21:42:59,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:42:59,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336645288] [2024-10-12 21:42:59,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336645288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:42:59,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:42:59,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:42:59,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728654002] [2024-10-12 21:42:59,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:42:59,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:42:59,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:42:59,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:42:59,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:42:59,615 INFO L87 Difference]: Start difference. First operand 23074 states and 37804 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:43:02,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:02,642 INFO L93 Difference]: Finished difference Result 54024 states and 89997 transitions. [2024-10-12 21:43:02,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 21:43:02,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:43:02,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:02,741 INFO L225 Difference]: With dead ends: 54024 [2024-10-12 21:43:02,741 INFO L226 Difference]: Without dead ends: 30970 [2024-10-12 21:43:02,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-12 21:43:02,786 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 1407 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:02,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 959 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 21:43:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30970 states. [2024-10-12 21:43:04,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30970 to 23074. [2024-10-12 21:43:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23074 states, 21182 states have (on average 1.6086299688414691) internal successors, (34074), 21248 states have internal predecessors, (34074), 1437 states have call successors, (1437), 391 states have call predecessors, (1437), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2024-10-12 21:43:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23074 states to 23074 states and 37739 transitions. [2024-10-12 21:43:04,621 INFO L78 Accepts]: Start accepts. Automaton has 23074 states and 37739 transitions. Word has length 172 [2024-10-12 21:43:04,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:04,622 INFO L471 AbstractCegarLoop]: Abstraction has 23074 states and 37739 transitions. [2024-10-12 21:43:04,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:43:04,622 INFO L276 IsEmpty]: Start isEmpty. Operand 23074 states and 37739 transitions. [2024-10-12 21:43:04,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:43:04,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:04,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:04,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-12 21:43:04,636 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:04,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:04,636 INFO L85 PathProgramCache]: Analyzing trace with hash -904725756, now seen corresponding path program 1 times [2024-10-12 21:43:04,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:04,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97731585] [2024-10-12 21:43:04,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:04,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:04,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:43:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:43:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:43:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:43:04,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:04,880 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 21:43:04,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:04,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97731585] [2024-10-12 21:43:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97731585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:04,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:04,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:04,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16427876] [2024-10-12 21:43:04,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:04,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:04,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:04,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:04,882 INFO L87 Difference]: Start difference. First operand 23074 states and 37739 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:43:11,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:11,754 INFO L93 Difference]: Finished difference Result 83143 states and 137763 transitions. [2024-10-12 21:43:11,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 21:43:11,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:43:11,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:11,937 INFO L225 Difference]: With dead ends: 83143 [2024-10-12 21:43:11,938 INFO L226 Difference]: Without dead ends: 60089 [2024-10-12 21:43:11,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-12 21:43:11,996 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 1607 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 3812 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 3881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:11,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 2230 Invalid, 3881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3812 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:43:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60089 states. [2024-10-12 21:43:16,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60089 to 46005. [2024-10-12 21:43:16,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46005 states, 42257 states have (on average 1.6073076650022482) internal successors, (67920), 42387 states have internal predecessors, (67920), 2845 states have call successors, (2845), 775 states have call predecessors, (2845), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2024-10-12 21:43:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46005 states to 46005 states and 75923 transitions. [2024-10-12 21:43:16,514 INFO L78 Accepts]: Start accepts. Automaton has 46005 states and 75923 transitions. Word has length 172 [2024-10-12 21:43:16,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 21:43:16,515 INFO L471 AbstractCegarLoop]: Abstraction has 46005 states and 75923 transitions. [2024-10-12 21:43:16,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:43:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 46005 states and 75923 transitions. [2024-10-12 21:43:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-12 21:43:16,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 21:43:16,537 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:16,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-12 21:43:16,538 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 21:43:16,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 21:43:16,538 INFO L85 PathProgramCache]: Analyzing trace with hash -835077882, now seen corresponding path program 1 times [2024-10-12 21:43:16,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 21:43:16,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149149346] [2024-10-12 21:43:16,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 21:43:16,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 21:43:16,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:16,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 21:43:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:16,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 21:43:16,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:16,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 21:43:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:16,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 21:43:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:16,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-12 21:43:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 21:43:16,747 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 21:43:16,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 21:43:16,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149149346] [2024-10-12 21:43:16,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149149346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 21:43:16,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 21:43:16,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 21:43:16,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26605705] [2024-10-12 21:43:16,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 21:43:16,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 21:43:16,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 21:43:16,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 21:43:16,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 21:43:16,749 INFO L87 Difference]: Start difference. First operand 46005 states and 75923 transitions. Second operand has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-12 21:43:28,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 21:43:28,045 INFO L93 Difference]: Finished difference Result 186360 states and 310847 transitions. [2024-10-12 21:43:28,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-12 21:43:28,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.0) internal successors, (161), 5 states have internal predecessors, (161), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 172 [2024-10-12 21:43:28,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 21:43:28,654 INFO L225 Difference]: With dead ends: 186360 [2024-10-12 21:43:28,655 INFO L226 Difference]: Without dead ends: 140375 [2024-10-12 21:43:28,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-12 21:43:28,807 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 2075 mSDsluCounter, 1713 mSDsCounter, 0 mSdLazyCounter, 3789 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2109 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 3861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 3789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-12 21:43:28,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2109 Valid, 2223 Invalid, 3861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 3789 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-12 21:43:28,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140375 states.