./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.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 52de5146a3a24866d31d2076a85235f80d04004402c35cfcf3c3304704a7fec0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:56:05,817 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:56:05,897 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:56:05,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:56:05,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:56:05,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:56:05,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:56:05,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:56:05,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:56:05,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:56:05,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:56:05,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:56:05,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:56:05,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:56:05,942 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:56:05,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:56:05,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:56:05,943 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:56:05,944 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:56:05,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:56:05,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:56:05,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:56:05,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:56:05,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:56:05,946 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:56:05,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:56:05,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:56:05,946 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:56:05,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:56:05,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:56:05,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:56:05,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:56:05,948 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:56:05,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:56:05,952 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:56:05,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:56:05,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:56:05,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:56:05,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:56:05,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:56:05,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:56:05,955 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:56:05,955 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 -> 52de5146a3a24866d31d2076a85235f80d04004402c35cfcf3c3304704a7fec0 [2024-11-11 22:56:06,244 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:56:06,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:56:06,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:56:06,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:56:06,276 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:56:06,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c [2024-11-11 22:56:07,720 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:56:07,934 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:56:07,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c [2024-11-11 22:56:07,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba18d6d3/23ae3d8fce08452ca797def5a4f5dde5/FLAGfd1edd072 [2024-11-11 22:56:07,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cba18d6d3/23ae3d8fce08452ca797def5a4f5dde5 [2024-11-11 22:56:07,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:56:07,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:56:07,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:56:07,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:56:07,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:56:07,982 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:56:07" (1/1) ... [2024-11-11 22:56:07,985 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45dc2e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:07, skipping insertion in model container [2024-11-11 22:56:07,986 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:56:07" (1/1) ... [2024-11-11 22:56:08,037 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:56:08,204 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[914,927] [2024-11-11 22:56:08,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[7115,7128] [2024-11-11 22:56:08,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:56:08,324 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:56:08,336 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[914,927] [2024-11-11 22:56:08,372 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_2.cil-1+token_ring.05.cil-1.c[7115,7128] [2024-11-11 22:56:08,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:56:08,440 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:56:08,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08 WrapperNode [2024-11-11 22:56:08,440 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:56:08,441 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:56:08,442 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:56:08,442 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:56:08,461 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,471 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,503 INFO L138 Inliner]: procedures = 63, calls = 72, calls flagged for inlining = 32, calls inlined = 32, statements flattened = 648 [2024-11-11 22:56:08,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:56:08,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:56:08,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:56:08,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:56:08,515 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,540 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 22:56:08,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,552 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,563 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:56:08,580 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:56:08,580 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:56:08,580 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:56:08,581 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (1/1) ... [2024-11-11 22:56:08,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:56:08,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:56:08,620 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 22:56:08,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 22:56:08,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:56:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:56:08,673 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:56:08,673 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-11 22:56:08,674 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-11 22:56:08,675 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-11 22:56:08,675 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-11 22:56:08,675 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-11 22:56:08,675 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-11 22:56:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-11 22:56:08,676 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-11 22:56:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-11 22:56:08,676 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-11 22:56:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-11 22:56:08,676 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-11 22:56:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-11 22:56:08,676 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-11 22:56:08,676 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-11 22:56:08,677 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-11 22:56:08,677 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-11 22:56:08,677 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-11 22:56:08,677 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-11 22:56:08,678 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-11 22:56:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:56:08,678 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-11 22:56:08,678 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-11 22:56:08,679 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-11 22:56:08,679 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-11 22:56:08,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:56:08,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:56:08,679 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-11 22:56:08,679 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-11 22:56:08,820 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:56:08,826 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:56:09,593 INFO L? ?]: Removed 85 outVars from TransFormulas that were not future-live. [2024-11-11 22:56:09,594 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:56:09,614 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:56:09,614 INFO L316 CfgBuilder]: Removed 12 assume(true) statements. [2024-11-11 22:56:09,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:56:09 BoogieIcfgContainer [2024-11-11 22:56:09,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:56:09,618 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:56:09,618 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:56:09,621 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:56:09,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:56:07" (1/3) ... [2024-11-11 22:56:09,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743de85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:56:09, skipping insertion in model container [2024-11-11 22:56:09,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:56:08" (2/3) ... [2024-11-11 22:56:09,623 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@743de85c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:56:09, skipping insertion in model container [2024-11-11 22:56:09,624 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:56:09" (3/3) ... [2024-11-11 22:56:09,625 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-1+token_ring.05.cil-1.c [2024-11-11 22:56:09,638 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:56:09,638 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:56:09,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:56:09,712 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;@5da08037, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:56:09,712 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:56:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand has 314 states, 264 states have (on average 1.5833333333333333) internal successors, (418), 270 states have internal predecessors, (418), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) [2024-11-11 22:56:09,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:09,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:09,729 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:09,730 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:09,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:09,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1889753707, now seen corresponding path program 1 times [2024-11-11 22:56:09,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:09,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18209475] [2024-11-11 22:56:09,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:09,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:10,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:10,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:10,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18209475] [2024-11-11 22:56:10,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18209475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:10,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:10,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:56:10,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554022577] [2024-11-11 22:56:10,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:10,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:56:10,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:10,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:56:10,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:56:10,246 INFO L87 Difference]: Start difference. First operand has 314 states, 264 states have (on average 1.5833333333333333) internal successors, (418), 270 states have internal predecessors, (418), 33 states have call successors, (33), 14 states have call predecessors, (33), 14 states have return successors, (33), 32 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:11,141 INFO L93 Difference]: Finished difference Result 625 states and 961 transitions. [2024-11-11 22:56:11,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 22:56:11,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:56:11,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:11,156 INFO L225 Difference]: With dead ends: 625 [2024-11-11 22:56:11,156 INFO L226 Difference]: Without dead ends: 322 [2024-11-11 22:56:11,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:11,165 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 476 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:11,166 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 1054 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:11,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-11 22:56:11,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 304. [2024-11-11 22:56:11,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 256 states have (on average 1.48828125) internal successors, (381), 260 states have internal predecessors, (381), 33 states have call successors, (33), 14 states have call predecessors, (33), 13 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-11 22:56:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 445 transitions. [2024-11-11 22:56:11,232 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 445 transitions. Word has length 65 [2024-11-11 22:56:11,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:11,233 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 445 transitions. [2024-11-11 22:56:11,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:11,234 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 445 transitions. [2024-11-11 22:56:11,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:11,238 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:11,238 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:11,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:56:11,240 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:11,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:11,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1018428179, now seen corresponding path program 1 times [2024-11-11 22:56:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819267727] [2024-11-11 22:56:11,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:11,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:11,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819267727] [2024-11-11 22:56:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819267727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:11,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:11,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:11,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523826853] [2024-11-11 22:56:11,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:11,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:11,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:11,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:11,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:11,502 INFO L87 Difference]: Start difference. First operand 304 states and 445 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:12,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:12,483 INFO L93 Difference]: Finished difference Result 527 states and 759 transitions. [2024-11-11 22:56:12,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:12,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:56:12,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:12,488 INFO L225 Difference]: With dead ends: 527 [2024-11-11 22:56:12,489 INFO L226 Difference]: Without dead ends: 439 [2024-11-11 22:56:12,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:56:12,496 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 580 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:12,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 1487 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:56:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-11 22:56:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 400. [2024-11-11 22:56:12,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 332 states have (on average 1.4608433734939759) internal successors, (485), 338 states have internal predecessors, (485), 44 states have call successors, (44), 21 states have call predecessors, (44), 22 states have return successors, (47), 43 states have call predecessors, (47), 42 states have call successors, (47) [2024-11-11 22:56:12,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 576 transitions. [2024-11-11 22:56:12,548 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 576 transitions. Word has length 65 [2024-11-11 22:56:12,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:12,548 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 576 transitions. [2024-11-11 22:56:12,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 576 transitions. [2024-11-11 22:56:12,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:12,551 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:12,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:12,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:56:12,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:12,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:12,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1422214130, now seen corresponding path program 1 times [2024-11-11 22:56:12,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:12,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960660242] [2024-11-11 22:56:12,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:12,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:12,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:12,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:12,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:12,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:12,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:12,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:12,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:12,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:12,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960660242] [2024-11-11 22:56:12,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960660242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:12,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:12,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:12,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038120356] [2024-11-11 22:56:12,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:12,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:12,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:12,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:12,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:12,793 INFO L87 Difference]: Start difference. First operand 400 states and 576 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:13,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:13,862 INFO L93 Difference]: Finished difference Result 747 states and 1052 transitions. [2024-11-11 22:56:13,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:56:13,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:56:13,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:13,869 INFO L225 Difference]: With dead ends: 747 [2024-11-11 22:56:13,869 INFO L226 Difference]: Without dead ends: 570 [2024-11-11 22:56:13,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-11 22:56:13,874 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 1098 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:13,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1332 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:56:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-11 22:56:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 496. [2024-11-11 22:56:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 408 states have (on average 1.4411764705882353) internal successors, (588), 416 states have internal predecessors, (588), 55 states have call successors, (55), 28 states have call predecessors, (55), 31 states have return successors, (66), 55 states have call predecessors, (66), 53 states have call successors, (66) [2024-11-11 22:56:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 709 transitions. [2024-11-11 22:56:13,927 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 709 transitions. Word has length 65 [2024-11-11 22:56:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:13,928 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 709 transitions. [2024-11-11 22:56:13,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 709 transitions. [2024-11-11 22:56:13,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:13,930 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:13,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:13,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:56:13,931 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:13,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:13,932 INFO L85 PathProgramCache]: Analyzing trace with hash -606371980, now seen corresponding path program 1 times [2024-11-11 22:56:13,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:13,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272402194] [2024-11-11 22:56:13,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:13,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:13,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:14,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:14,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:14,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:14,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:14,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:14,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272402194] [2024-11-11 22:56:14,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272402194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:14,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:14,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:56:14,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418047376] [2024-11-11 22:56:14,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:14,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:56:14,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:14,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:56:14,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:56:14,086 INFO L87 Difference]: Start difference. First operand 496 states and 709 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:15,083 INFO L93 Difference]: Finished difference Result 795 states and 1120 transitions. [2024-11-11 22:56:15,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:15,084 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-11 22:56:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:15,088 INFO L225 Difference]: With dead ends: 795 [2024-11-11 22:56:15,088 INFO L226 Difference]: Without dead ends: 528 [2024-11-11 22:56:15,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:56:15,090 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 368 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:15,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1781 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:56:15,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-11 22:56:15,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 501. [2024-11-11 22:56:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 412 states have (on average 1.4320388349514563) internal successors, (590), 420 states have internal predecessors, (590), 55 states have call successors, (55), 28 states have call predecessors, (55), 32 states have return successors, (67), 56 states have call predecessors, (67), 53 states have call successors, (67) [2024-11-11 22:56:15,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 712 transitions. [2024-11-11 22:56:15,129 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 712 transitions. Word has length 65 [2024-11-11 22:56:15,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:15,129 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 712 transitions. [2024-11-11 22:56:15,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:15,130 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 712 transitions. [2024-11-11 22:56:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:15,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:15,132 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:15,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:56:15,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:15,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:15,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1635731278, now seen corresponding path program 1 times [2024-11-11 22:56:15,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:15,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907434919] [2024-11-11 22:56:15,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:15,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:15,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:15,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:15,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907434919] [2024-11-11 22:56:15,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907434919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:15,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:15,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:56:15,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083542699] [2024-11-11 22:56:15,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:15,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:56:15,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:15,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:56:15,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:56:15,282 INFO L87 Difference]: Start difference. First operand 501 states and 712 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:16,188 INFO L93 Difference]: Finished difference Result 817 states and 1142 transitions. [2024-11-11 22:56:16,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 22:56:16,188 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2024-11-11 22:56:16,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:16,192 INFO L225 Difference]: With dead ends: 817 [2024-11-11 22:56:16,192 INFO L226 Difference]: Without dead ends: 545 [2024-11-11 22:56:16,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:56:16,193 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 552 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 1296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:16,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 1582 Invalid, 1296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 22:56:16,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-11 22:56:16,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 516. [2024-11-11 22:56:16,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 424 states have (on average 1.419811320754717) internal successors, (602), 432 states have internal predecessors, (602), 55 states have call successors, (55), 28 states have call predecessors, (55), 35 states have return successors, (70), 59 states have call predecessors, (70), 53 states have call successors, (70) [2024-11-11 22:56:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 727 transitions. [2024-11-11 22:56:16,227 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 727 transitions. Word has length 65 [2024-11-11 22:56:16,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:16,228 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 727 transitions. [2024-11-11 22:56:16,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:16,228 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 727 transitions. [2024-11-11 22:56:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:16,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:16,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:16,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:56:16,230 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:16,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:16,231 INFO L85 PathProgramCache]: Analyzing trace with hash -249527884, now seen corresponding path program 1 times [2024-11-11 22:56:16,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:16,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693316879] [2024-11-11 22:56:16,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:16,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:16,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:16,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:16,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:16,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693316879] [2024-11-11 22:56:16,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693316879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:16,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:16,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:16,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026156474] [2024-11-11 22:56:16,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:16,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:16,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:16,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:16,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:16,422 INFO L87 Difference]: Start difference. First operand 516 states and 727 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:17,377 INFO L93 Difference]: Finished difference Result 908 states and 1238 transitions. [2024-11-11 22:56:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 22:56:17,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:56:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:17,381 INFO L225 Difference]: With dead ends: 908 [2024-11-11 22:56:17,381 INFO L226 Difference]: Without dead ends: 623 [2024-11-11 22:56:17,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2024-11-11 22:56:17,385 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 1090 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:17,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1143 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:56:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2024-11-11 22:56:17,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 528. [2024-11-11 22:56:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 434 states have (on average 1.4101382488479262) internal successors, (612), 442 states have internal predecessors, (612), 56 states have call successors, (56), 29 states have call predecessors, (56), 36 states have return successors, (69), 60 states have call predecessors, (69), 54 states have call successors, (69) [2024-11-11 22:56:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 737 transitions. [2024-11-11 22:56:17,431 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 737 transitions. Word has length 65 [2024-11-11 22:56:17,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:17,432 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 737 transitions. [2024-11-11 22:56:17,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:17,432 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 737 transitions. [2024-11-11 22:56:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-11 22:56:17,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:17,438 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:17,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:56:17,438 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:17,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash -383541390, now seen corresponding path program 1 times [2024-11-11 22:56:17,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:17,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625348201] [2024-11-11 22:56:17,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:17,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:17,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:17,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:17,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625348201] [2024-11-11 22:56:17,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625348201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:17,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:17,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:17,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74139888] [2024-11-11 22:56:17,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:17,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:17,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:17,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:17,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:17,560 INFO L87 Difference]: Start difference. First operand 528 states and 737 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:18,228 INFO L93 Difference]: Finished difference Result 1170 states and 1581 transitions. [2024-11-11 22:56:18,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 22:56:18,229 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-11 22:56:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:18,235 INFO L225 Difference]: With dead ends: 1170 [2024-11-11 22:56:18,235 INFO L226 Difference]: Without dead ends: 874 [2024-11-11 22:56:18,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:56:18,237 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 1072 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:18,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 893 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:56:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-11 22:56:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 818. [2024-11-11 22:56:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 658 states have (on average 1.3617021276595744) internal successors, (896), 673 states have internal predecessors, (896), 91 states have call successors, (91), 51 states have call predecessors, (91), 67 states have return successors, (126), 100 states have call predecessors, (126), 89 states have call successors, (126) [2024-11-11 22:56:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1113 transitions. [2024-11-11 22:56:18,290 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1113 transitions. Word has length 65 [2024-11-11 22:56:18,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:18,290 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1113 transitions. [2024-11-11 22:56:18,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-11 22:56:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1113 transitions. [2024-11-11 22:56:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 22:56:18,294 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:18,294 INFO L218 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] [2024-11-11 22:56:18,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:56:18,294 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:18,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:18,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1678158755, now seen corresponding path program 1 times [2024-11-11 22:56:18,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:18,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642245980] [2024-11-11 22:56:18,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:18,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:18,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:18,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642245980] [2024-11-11 22:56:18,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642245980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:18,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:18,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:56:18,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964387191] [2024-11-11 22:56:18,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:18,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:56:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:18,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:56:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:56:18,383 INFO L87 Difference]: Start difference. First operand 818 states and 1113 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:19,154 INFO L93 Difference]: Finished difference Result 2021 states and 2680 transitions. [2024-11-11 22:56:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:19,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-11 22:56:19,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:19,163 INFO L225 Difference]: With dead ends: 2021 [2024-11-11 22:56:19,163 INFO L226 Difference]: Without dead ends: 1414 [2024-11-11 22:56:19,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:19,166 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 560 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:19,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 1050 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 561 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:56:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-11-11 22:56:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1299. [2024-11-11 22:56:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1037 states have (on average 1.3297974927675988) internal successors, (1379), 1055 states have internal predecessors, (1379), 136 states have call successors, (136), 95 states have call predecessors, (136), 124 states have return successors, (198), 155 states have call predecessors, (198), 134 states have call successors, (198) [2024-11-11 22:56:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1713 transitions. [2024-11-11 22:56:19,255 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1713 transitions. Word has length 66 [2024-11-11 22:56:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:19,255 INFO L471 AbstractCegarLoop]: Abstraction has 1299 states and 1713 transitions. [2024-11-11 22:56:19,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1713 transitions. [2024-11-11 22:56:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-11 22:56:19,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:19,259 INFO L218 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] [2024-11-11 22:56:19,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:56:19,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:19,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:19,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1158568882, now seen corresponding path program 1 times [2024-11-11 22:56:19,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:19,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249117218] [2024-11-11 22:56:19,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:19,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:19,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:19,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249117218] [2024-11-11 22:56:19,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249117218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:19,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:19,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:56:19,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843295127] [2024-11-11 22:56:19,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:19,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:56:19,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:19,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:56:19,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:56:19,384 INFO L87 Difference]: Start difference. First operand 1299 states and 1713 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:20,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:20,078 INFO L93 Difference]: Finished difference Result 3487 states and 4519 transitions. [2024-11-11 22:56:20,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:56:20,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-11 22:56:20,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:20,089 INFO L225 Difference]: With dead ends: 3487 [2024-11-11 22:56:20,090 INFO L226 Difference]: Without dead ends: 2419 [2024-11-11 22:56:20,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-11 22:56:20,093 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 1072 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:20,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 698 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:56:20,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2419 states. [2024-11-11 22:56:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2419 to 2161. [2024-11-11 22:56:20,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2161 states, 1703 states have (on average 1.2953611274221961) internal successors, (2206), 1731 states have internal predecessors, (2206), 234 states have call successors, (234), 179 states have call predecessors, (234), 222 states have return successors, (334), 257 states have call predecessors, (334), 232 states have call successors, (334) [2024-11-11 22:56:20,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2774 transitions. [2024-11-11 22:56:20,256 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2774 transitions. Word has length 66 [2024-11-11 22:56:20,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:20,256 INFO L471 AbstractCegarLoop]: Abstraction has 2161 states and 2774 transitions. [2024-11-11 22:56:20,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2774 transitions. [2024-11-11 22:56:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-11 22:56:20,258 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:20,259 INFO L218 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] [2024-11-11 22:56:20,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:56:20,259 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:20,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:20,260 INFO L85 PathProgramCache]: Analyzing trace with hash 135899394, now seen corresponding path program 1 times [2024-11-11 22:56:20,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:20,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362929269] [2024-11-11 22:56:20,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:20,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:20,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:20,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362929269] [2024-11-11 22:56:20,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362929269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:20,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:20,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:56:20,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942257217] [2024-11-11 22:56:20,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:20,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:56:20,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:20,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:56:20,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:56:20,360 INFO L87 Difference]: Start difference. First operand 2161 states and 2774 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:21,082 INFO L93 Difference]: Finished difference Result 5071 states and 6424 transitions. [2024-11-11 22:56:21,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:21,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-11 22:56:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:21,100 INFO L225 Difference]: With dead ends: 5071 [2024-11-11 22:56:21,101 INFO L226 Difference]: Without dead ends: 3141 [2024-11-11 22:56:21,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:21,106 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 1053 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:21,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 734 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 22:56:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-11-11 22:56:21,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2893. [2024-11-11 22:56:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2893 states, 2271 states have (on average 1.2813738441215323) internal successors, (2910), 2307 states have internal predecessors, (2910), 314 states have call successors, (314), 249 states have call predecessors, (314), 306 states have return successors, (443), 343 states have call predecessors, (443), 312 states have call successors, (443) [2024-11-11 22:56:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 3667 transitions. [2024-11-11 22:56:21,353 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 3667 transitions. Word has length 72 [2024-11-11 22:56:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:21,354 INFO L471 AbstractCegarLoop]: Abstraction has 2893 states and 3667 transitions. [2024-11-11 22:56:21,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 3 states have internal predecessors, (57), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-11 22:56:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 3667 transitions. [2024-11-11 22:56:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-11 22:56:21,356 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:21,356 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:21,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 22:56:21,356 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:21,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash -598508016, now seen corresponding path program 1 times [2024-11-11 22:56:21,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:21,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214178492] [2024-11-11 22:56:21,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:21,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:21,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:21,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:21,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:21,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214178492] [2024-11-11 22:56:21,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214178492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:21,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:21,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:21,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926304142] [2024-11-11 22:56:21,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:21,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:21,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:21,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:21,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:21,461 INFO L87 Difference]: Start difference. First operand 2893 states and 3667 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:56:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:22,376 INFO L93 Difference]: Finished difference Result 3667 states and 4598 transitions. [2024-11-11 22:56:22,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 22:56:22,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2024-11-11 22:56:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:22,398 INFO L225 Difference]: With dead ends: 3667 [2024-11-11 22:56:22,399 INFO L226 Difference]: Without dead ends: 3664 [2024-11-11 22:56:22,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2024-11-11 22:56:22,402 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 1502 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:22,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 710 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:56:22,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2024-11-11 22:56:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3387. [2024-11-11 22:56:22,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3387 states, 2656 states have (on average 1.2733433734939759) internal successors, (3382), 2697 states have internal predecessors, (3382), 364 states have call successors, (364), 293 states have call predecessors, (364), 365 states have return successors, (522), 403 states have call predecessors, (522), 363 states have call successors, (522) [2024-11-11 22:56:22,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3387 states to 3387 states and 4268 transitions. [2024-11-11 22:56:22,748 INFO L78 Accepts]: Start accepts. Automaton has 3387 states and 4268 transitions. Word has length 73 [2024-11-11 22:56:22,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:22,749 INFO L471 AbstractCegarLoop]: Abstraction has 3387 states and 4268 transitions. [2024-11-11 22:56:22,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:56:22,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3387 states and 4268 transitions. [2024-11-11 22:56:22,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-11 22:56:22,752 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:22,752 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:22,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 22:56:22,752 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:22,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:22,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1374805236, now seen corresponding path program 1 times [2024-11-11 22:56:22,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:22,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798790895] [2024-11-11 22:56:22,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:22,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:22,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:22,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:22,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798790895] [2024-11-11 22:56:22,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798790895] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 22:56:22,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482491146] [2024-11-11 22:56:22,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:22,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 22:56:22,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:56:22,952 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 22:56:22,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 22:56:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:23,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 22:56:23,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 22:56:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:23,411 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 22:56:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:23,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482491146] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 22:56:23,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 22:56:23,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 4] total 10 [2024-11-11 22:56:23,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232342293] [2024-11-11 22:56:23,540 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 22:56:23,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 22:56:23,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:23,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 22:56:23,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:56:23,542 INFO L87 Difference]: Start difference. First operand 3387 states and 4268 transitions. Second operand has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-11 22:56:25,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:25,528 INFO L93 Difference]: Finished difference Result 7828 states and 9754 transitions. [2024-11-11 22:56:25,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-11 22:56:25,529 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 74 [2024-11-11 22:56:25,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:25,569 INFO L225 Difference]: With dead ends: 7828 [2024-11-11 22:56:25,569 INFO L226 Difference]: Without dead ends: 7825 [2024-11-11 22:56:25,574 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=642, Unknown=0, NotChecked=0, Total=812 [2024-11-11 22:56:25,574 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 1690 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 1678 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1755 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 1890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:25,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1755 Valid, 1919 Invalid, 1890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1678 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:56:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7825 states. [2024-11-11 22:56:26,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7825 to 5177. [2024-11-11 22:56:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5177 states, 4060 states have (on average 1.2704433497536947) internal successors, (5158), 4123 states have internal predecessors, (5158), 548 states have call successors, (548), 451 states have call predecessors, (548), 567 states have return successors, (800), 609 states have call predecessors, (800), 547 states have call successors, (800) [2024-11-11 22:56:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5177 states to 5177 states and 6506 transitions. [2024-11-11 22:56:26,240 INFO L78 Accepts]: Start accepts. Automaton has 5177 states and 6506 transitions. Word has length 74 [2024-11-11 22:56:26,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:26,241 INFO L471 AbstractCegarLoop]: Abstraction has 5177 states and 6506 transitions. [2024-11-11 22:56:26,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.0) internal successors, (120), 7 states have internal predecessors, (120), 4 states have call successors, (20), 6 states have call predecessors, (20), 2 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-11 22:56:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5177 states and 6506 transitions. [2024-11-11 22:56:26,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-11 22:56:26,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:26,244 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:26,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 22:56:26,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-11 22:56:26,449 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:26,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:26,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1132390512, now seen corresponding path program 2 times [2024-11-11 22:56:26,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:26,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962664722] [2024-11-11 22:56:26,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:26,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:26,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:26,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:26,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962664722] [2024-11-11 22:56:26,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962664722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:26,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:26,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:56:26,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879519517] [2024-11-11 22:56:26,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:26,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:56:26,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:26,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:56:26,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:56:26,531 INFO L87 Difference]: Start difference. First operand 5177 states and 6506 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:56:27,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:27,527 INFO L93 Difference]: Finished difference Result 7859 states and 9879 transitions. [2024-11-11 22:56:27,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 22:56:27,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 77 [2024-11-11 22:56:27,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:27,547 INFO L225 Difference]: With dead ends: 7859 [2024-11-11 22:56:27,547 INFO L226 Difference]: Without dead ends: 3784 [2024-11-11 22:56:27,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-11 22:56:27,557 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 761 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 1026 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:27,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 1026 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 22:56:27,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2024-11-11 22:56:27,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 3549. [2024-11-11 22:56:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3549 states, 2788 states have (on average 1.2546628407460545) internal successors, (3498), 2829 states have internal predecessors, (3498), 380 states have call successors, (380), 307 states have call predecessors, (380), 379 states have return successors, (526), 419 states have call predecessors, (526), 379 states have call successors, (526) [2024-11-11 22:56:27,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3549 states to 3549 states and 4404 transitions. [2024-11-11 22:56:27,931 INFO L78 Accepts]: Start accepts. Automaton has 3549 states and 4404 transitions. Word has length 77 [2024-11-11 22:56:27,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:27,932 INFO L471 AbstractCegarLoop]: Abstraction has 3549 states and 4404 transitions. [2024-11-11 22:56:27,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-11 22:56:27,932 INFO L276 IsEmpty]: Start isEmpty. Operand 3549 states and 4404 transitions. [2024-11-11 22:56:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-11 22:56:27,935 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:27,935 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:27,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 22:56:27,936 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:27,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash 532498142, now seen corresponding path program 1 times [2024-11-11 22:56:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:27,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695022455] [2024-11-11 22:56:27,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:28,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:28,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:28,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:28,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:28,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:28,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:28,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:28,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:28,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:28,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 22:56:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 22:56:28,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:28,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695022455] [2024-11-11 22:56:28,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695022455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:28,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:28,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 22:56:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349778242] [2024-11-11 22:56:28,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:28,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 22:56:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 22:56:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-11 22:56:28,066 INFO L87 Difference]: Start difference. First operand 3549 states and 4404 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:29,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:29,624 INFO L93 Difference]: Finished difference Result 10405 states and 12785 transitions. [2024-11-11 22:56:29,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 22:56:29,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 84 [2024-11-11 22:56:29,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:29,650 INFO L225 Difference]: With dead ends: 10405 [2024-11-11 22:56:29,651 INFO L226 Difference]: Without dead ends: 5784 [2024-11-11 22:56:29,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2024-11-11 22:56:29,663 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 786 mSDsluCounter, 1339 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:29,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1614 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:56:29,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5784 states. [2024-11-11 22:56:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5784 to 5464. [2024-11-11 22:56:30,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5464 states, 4246 states have (on average 1.2305699481865284) internal successors, (5225), 4330 states have internal predecessors, (5225), 584 states have call successors, (584), 481 states have call predecessors, (584), 632 states have return successors, (908), 659 states have call predecessors, (908), 583 states have call successors, (908) [2024-11-11 22:56:30,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5464 states to 5464 states and 6717 transitions. [2024-11-11 22:56:30,457 INFO L78 Accepts]: Start accepts. Automaton has 5464 states and 6717 transitions. Word has length 84 [2024-11-11 22:56:30,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:30,457 INFO L471 AbstractCegarLoop]: Abstraction has 5464 states and 6717 transitions. [2024-11-11 22:56:30,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 5 states have internal predecessors, (63), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 5464 states and 6717 transitions. [2024-11-11 22:56:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 22:56:30,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:30,462 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 22:56:30,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 22:56:30,463 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:30,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:30,463 INFO L85 PathProgramCache]: Analyzing trace with hash 17095470, now seen corresponding path program 1 times [2024-11-11 22:56:30,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:30,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255299417] [2024-11-11 22:56:30,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:30,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 22:56:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 22:56:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 22:56:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-11 22:56:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 22:56:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 22:56:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 22:56:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:30,583 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 22:56:30,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:30,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255299417] [2024-11-11 22:56:30,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255299417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:30,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:30,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 22:56:30,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018800126] [2024-11-11 22:56:30,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:30,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 22:56:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:30,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 22:56:30,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:56:30,586 INFO L87 Difference]: Start difference. First operand 5464 states and 6717 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:32,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:32,035 INFO L93 Difference]: Finished difference Result 9467 states and 11557 transitions. [2024-11-11 22:56:32,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 22:56:32,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 93 [2024-11-11 22:56:32,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:32,068 INFO L225 Difference]: With dead ends: 9467 [2024-11-11 22:56:32,068 INFO L226 Difference]: Without dead ends: 4874 [2024-11-11 22:56:32,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=540, Unknown=0, NotChecked=0, Total=702 [2024-11-11 22:56:32,082 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 2024 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2063 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:32,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2063 Valid, 1218 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 22:56:32,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2024-11-11 22:56:32,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 4540. [2024-11-11 22:56:32,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4540 states, 3535 states have (on average 1.223196605374823) internal successors, (4324), 3601 states have internal predecessors, (4324), 485 states have call successors, (485), 396 states have call predecessors, (485), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2024-11-11 22:56:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4540 states to 4540 states and 5495 transitions. [2024-11-11 22:56:32,548 INFO L78 Accepts]: Start accepts. Automaton has 4540 states and 5495 transitions. Word has length 93 [2024-11-11 22:56:32,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:32,548 INFO L471 AbstractCegarLoop]: Abstraction has 4540 states and 5495 transitions. [2024-11-11 22:56:32,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-11 22:56:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 4540 states and 5495 transitions. [2024-11-11 22:56:32,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:56:32,552 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:32,553 INFO L218 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] [2024-11-11 22:56:32,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 22:56:32,553 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:32,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:32,554 INFO L85 PathProgramCache]: Analyzing trace with hash -890336660, now seen corresponding path program 1 times [2024-11-11 22:56:32,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:32,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307678134] [2024-11-11 22:56:32,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:32,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:56:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:56:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:56:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:56:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:32,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:32,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:32,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307678134] [2024-11-11 22:56:32,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307678134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:32,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:32,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:56:32,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651209537] [2024-11-11 22:56:32,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:32,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:56:32,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:32,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:56:32,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:56:32,650 INFO L87 Difference]: Start difference. First operand 4540 states and 5495 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:34,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:34,041 INFO L93 Difference]: Finished difference Result 4803 states and 5905 transitions. [2024-11-11 22:56:34,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 22:56:34,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:56:34,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:34,058 INFO L225 Difference]: With dead ends: 4803 [2024-11-11 22:56:34,058 INFO L226 Difference]: Without dead ends: 4605 [2024-11-11 22:56:34,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-11 22:56:34,061 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 613 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:34,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 658 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:56:34,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4605 states. [2024-11-11 22:56:34,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4605 to 4540. [2024-11-11 22:56:34,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4540 states, 3535 states have (on average 1.222913719943423) internal successors, (4323), 3601 states have internal predecessors, (4323), 485 states have call successors, (485), 396 states have call predecessors, (485), 518 states have return successors, (686), 549 states have call predecessors, (686), 484 states have call successors, (686) [2024-11-11 22:56:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4540 states to 4540 states and 5494 transitions. [2024-11-11 22:56:34,952 INFO L78 Accepts]: Start accepts. Automaton has 4540 states and 5494 transitions. Word has length 101 [2024-11-11 22:56:34,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:34,952 INFO L471 AbstractCegarLoop]: Abstraction has 4540 states and 5494 transitions. [2024-11-11 22:56:34,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:34,953 INFO L276 IsEmpty]: Start isEmpty. Operand 4540 states and 5494 transitions. [2024-11-11 22:56:34,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:56:34,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:34,958 INFO L218 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] [2024-11-11 22:56:34,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 22:56:34,958 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:34,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:34,959 INFO L85 PathProgramCache]: Analyzing trace with hash -119603094, now seen corresponding path program 1 times [2024-11-11 22:56:34,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:34,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158582836] [2024-11-11 22:56:34,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:34,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:35,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:35,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:56:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:35,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:56:35,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:35,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:56:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:35,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:56:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:35,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:35,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158582836] [2024-11-11 22:56:35,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158582836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:35,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:35,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 22:56:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529182661] [2024-11-11 22:56:35,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:35,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 22:56:35,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:35,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 22:56:35,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 22:56:35,106 INFO L87 Difference]: Start difference. First operand 4540 states and 5494 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:37,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:37,139 INFO L93 Difference]: Finished difference Result 5064 states and 6313 transitions. [2024-11-11 22:56:37,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 22:56:37,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:56:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:37,165 INFO L225 Difference]: With dead ends: 5064 [2024-11-11 22:56:37,166 INFO L226 Difference]: Without dead ends: 4869 [2024-11-11 22:56:37,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-11 22:56:37,171 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 984 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:37,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 929 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:56:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4869 states. [2024-11-11 22:56:37,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4869 to 4740. [2024-11-11 22:56:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4740 states, 3714 states have (on average 1.2380183091007) internal successors, (4598), 3781 states have internal predecessors, (4598), 499 states have call successors, (499), 402 states have call predecessors, (499), 525 states have return successors, (703), 563 states have call predecessors, (703), 498 states have call successors, (703) [2024-11-11 22:56:37,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4740 states to 4740 states and 5800 transitions. [2024-11-11 22:56:37,813 INFO L78 Accepts]: Start accepts. Automaton has 4740 states and 5800 transitions. Word has length 101 [2024-11-11 22:56:37,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:37,813 INFO L471 AbstractCegarLoop]: Abstraction has 4740 states and 5800 transitions. [2024-11-11 22:56:37,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:37,813 INFO L276 IsEmpty]: Start isEmpty. Operand 4740 states and 5800 transitions. [2024-11-11 22:56:37,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:56:37,817 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:37,817 INFO L218 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] [2024-11-11 22:56:37,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 22:56:37,818 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:37,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:37,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1836487698, now seen corresponding path program 1 times [2024-11-11 22:56:37,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:37,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718435184] [2024-11-11 22:56:37,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:37,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:56:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:56:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:56:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:56:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:37,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:37,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718435184] [2024-11-11 22:56:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718435184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:37,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:37,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:37,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861710523] [2024-11-11 22:56:37,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:37,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:37,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:37,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:37,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:37,961 INFO L87 Difference]: Start difference. First operand 4740 states and 5800 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:40,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:40,179 INFO L93 Difference]: Finished difference Result 5536 states and 7042 transitions. [2024-11-11 22:56:40,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:40,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:56:40,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:40,196 INFO L225 Difference]: With dead ends: 5536 [2024-11-11 22:56:40,197 INFO L226 Difference]: Without dead ends: 5141 [2024-11-11 22:56:40,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:56:40,202 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 997 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1978 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:40,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1617 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1978 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:56:40,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2024-11-11 22:56:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 4928. [2024-11-11 22:56:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4928 states, 3881 states have (on average 1.249420252512239) internal successors, (4849), 3949 states have internal predecessors, (4849), 513 states have call successors, (513), 408 states have call predecessors, (513), 532 states have return successors, (719), 578 states have call predecessors, (719), 512 states have call successors, (719) [2024-11-11 22:56:40,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4928 states to 4928 states and 6081 transitions. [2024-11-11 22:56:40,948 INFO L78 Accepts]: Start accepts. Automaton has 4928 states and 6081 transitions. Word has length 101 [2024-11-11 22:56:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:40,949 INFO L471 AbstractCegarLoop]: Abstraction has 4928 states and 6081 transitions. [2024-11-11 22:56:40,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:40,949 INFO L276 IsEmpty]: Start isEmpty. Operand 4928 states and 6081 transitions. [2024-11-11 22:56:40,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:56:40,954 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:40,954 INFO L218 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] [2024-11-11 22:56:40,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 22:56:40,954 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:40,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash -511631504, now seen corresponding path program 1 times [2024-11-11 22:56:40,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:40,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936563356] [2024-11-11 22:56:40,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:40,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:56:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:56:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:56:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:56:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:41,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:41,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936563356] [2024-11-11 22:56:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936563356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:41,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:41,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:41,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740391040] [2024-11-11 22:56:41,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:41,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:41,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:41,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:41,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:41,105 INFO L87 Difference]: Start difference. First operand 4928 states and 6081 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:43,689 INFO L93 Difference]: Finished difference Result 6229 states and 8103 transitions. [2024-11-11 22:56:43,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:43,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:56:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:43,709 INFO L225 Difference]: With dead ends: 6229 [2024-11-11 22:56:43,709 INFO L226 Difference]: Without dead ends: 5646 [2024-11-11 22:56:43,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:56:43,716 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 992 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:43,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 1615 Invalid, 2037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:56:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5646 states. [2024-11-11 22:56:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5646 to 5307. [2024-11-11 22:56:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5307 states, 4218 states have (on average 1.269796111901375) internal successors, (5356), 4288 states have internal predecessors, (5356), 541 states have call successors, (541), 420 states have call predecessors, (541), 546 states have return successors, (755), 608 states have call predecessors, (755), 540 states have call successors, (755) [2024-11-11 22:56:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5307 states to 5307 states and 6652 transitions. [2024-11-11 22:56:44,485 INFO L78 Accepts]: Start accepts. Automaton has 5307 states and 6652 transitions. Word has length 101 [2024-11-11 22:56:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:44,485 INFO L471 AbstractCegarLoop]: Abstraction has 5307 states and 6652 transitions. [2024-11-11 22:56:44,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 5307 states and 6652 transitions. [2024-11-11 22:56:44,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:56:44,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:44,491 INFO L218 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] [2024-11-11 22:56:44,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 22:56:44,491 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:44,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:44,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1055126446, now seen corresponding path program 1 times [2024-11-11 22:56:44,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:44,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350149964] [2024-11-11 22:56:44,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:44,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:44,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:44,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:44,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:56:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:44,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:56:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:44,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:56:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:44,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:56:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:44,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:44,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:44,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350149964] [2024-11-11 22:56:44,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350149964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:44,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:44,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:44,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165499463] [2024-11-11 22:56:44,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:44,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:44,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:44,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:44,634 INFO L87 Difference]: Start difference. First operand 5307 states and 6652 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:46,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:46,751 INFO L93 Difference]: Finished difference Result 7574 states and 10158 transitions. [2024-11-11 22:56:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:56:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:46,771 INFO L225 Difference]: With dead ends: 7574 [2024-11-11 22:56:46,772 INFO L226 Difference]: Without dead ends: 6612 [2024-11-11 22:56:46,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:56:46,777 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 991 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:46,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 1615 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:56:46,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6612 states. [2024-11-11 22:56:47,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6612 to 6068. [2024-11-11 22:56:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6068 states, 4895 states have (on average 1.3021450459652706) internal successors, (6374), 4969 states have internal predecessors, (6374), 597 states have call successors, (597), 444 states have call predecessors, (597), 574 states have return successors, (833), 668 states have call predecessors, (833), 596 states have call successors, (833) [2024-11-11 22:56:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6068 states to 6068 states and 7804 transitions. [2024-11-11 22:56:47,569 INFO L78 Accepts]: Start accepts. Automaton has 6068 states and 7804 transitions. Word has length 101 [2024-11-11 22:56:47,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:47,569 INFO L471 AbstractCegarLoop]: Abstraction has 6068 states and 7804 transitions. [2024-11-11 22:56:47,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:47,570 INFO L276 IsEmpty]: Start isEmpty. Operand 6068 states and 7804 transitions. [2024-11-11 22:56:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:56:47,574 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:47,574 INFO L218 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] [2024-11-11 22:56:47,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 22:56:47,575 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:47,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:47,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2711632, now seen corresponding path program 1 times [2024-11-11 22:56:47,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:47,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069854764] [2024-11-11 22:56:47,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:47,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:47,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:47,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:47,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:56:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:47,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:56:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:47,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:56:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:47,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:56:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:47,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:47,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069854764] [2024-11-11 22:56:47,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069854764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:47,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:47,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:47,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090671377] [2024-11-11 22:56:47,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:47,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:47,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:47,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:47,736 INFO L87 Difference]: Start difference. First operand 6068 states and 7804 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:50,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:50,082 INFO L93 Difference]: Finished difference Result 10265 states and 14288 transitions. [2024-11-11 22:56:50,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:56:50,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:56:50,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:50,113 INFO L225 Difference]: With dead ends: 10265 [2024-11-11 22:56:50,113 INFO L226 Difference]: Without dead ends: 8542 [2024-11-11 22:56:50,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:56:50,125 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 990 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 1927 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:50,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1615 Invalid, 2011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1927 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:56:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8542 states. [2024-11-11 22:56:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8542 to 7597. [2024-11-11 22:56:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7597 states, 6256 states have (on average 1.3459079283887467) internal successors, (8420), 6338 states have internal predecessors, (8420), 709 states have call successors, (709), 492 states have call predecessors, (709), 630 states have return successors, (1007), 788 states have call predecessors, (1007), 708 states have call successors, (1007) [2024-11-11 22:56:50,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7597 states to 7597 states and 10136 transitions. [2024-11-11 22:56:50,997 INFO L78 Accepts]: Start accepts. Automaton has 7597 states and 10136 transitions. Word has length 101 [2024-11-11 22:56:50,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:50,997 INFO L471 AbstractCegarLoop]: Abstraction has 7597 states and 10136 transitions. [2024-11-11 22:56:50,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:50,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7597 states and 10136 transitions. [2024-11-11 22:56:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:56:51,002 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:51,002 INFO L218 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] [2024-11-11 22:56:51,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 22:56:51,003 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:51,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1145214098, now seen corresponding path program 1 times [2024-11-11 22:56:51,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:51,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178842325] [2024-11-11 22:56:51,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:56:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:56:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:56:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:56:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:51,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:51,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178842325] [2024-11-11 22:56:51,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178842325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:51,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:51,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:51,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160894310] [2024-11-11 22:56:51,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:51,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:51,148 INFO L87 Difference]: Start difference. First operand 7597 states and 10136 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:53,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:53,937 INFO L93 Difference]: Finished difference Result 16912 states and 24500 transitions. [2024-11-11 22:56:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:56:53,938 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:56:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:53,984 INFO L225 Difference]: With dead ends: 16912 [2024-11-11 22:56:53,984 INFO L226 Difference]: Without dead ends: 13660 [2024-11-11 22:56:54,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:56:54,002 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1042 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 2256 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:54,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 1605 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2256 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:56:54,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13660 states. [2024-11-11 22:56:55,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13660 to 10622. [2024-11-11 22:56:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10622 states, 8961 states have (on average 1.3951567905367706) internal successors, (12502), 9059 states have internal predecessors, (12502), 917 states have call successors, (917), 588 states have call predecessors, (917), 742 states have return successors, (1393), 1012 states have call predecessors, (1393), 916 states have call successors, (1393) [2024-11-11 22:56:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10622 states to 10622 states and 14812 transitions. [2024-11-11 22:56:55,399 INFO L78 Accepts]: Start accepts. Automaton has 10622 states and 14812 transitions. Word has length 101 [2024-11-11 22:56:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:55,399 INFO L471 AbstractCegarLoop]: Abstraction has 10622 states and 14812 transitions. [2024-11-11 22:56:55,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:55,399 INFO L276 IsEmpty]: Start isEmpty. Operand 10622 states and 14812 transitions. [2024-11-11 22:56:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:56:55,405 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:55,405 INFO L218 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] [2024-11-11 22:56:55,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 22:56:55,406 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:55,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:55,406 INFO L85 PathProgramCache]: Analyzing trace with hash -904974352, now seen corresponding path program 1 times [2024-11-11 22:56:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:55,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673304593] [2024-11-11 22:56:55,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:55,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:55,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:55,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:56:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:55,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:56:55,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:55,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:56:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:55,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:56:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:55,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:56:55,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:56:55,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673304593] [2024-11-11 22:56:55,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673304593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:56:55,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:56:55,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:56:55,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244375957] [2024-11-11 22:56:55,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:56:55,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:56:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:56:55,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:56:55,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:56:55,543 INFO L87 Difference]: Start difference. First operand 10622 states and 14812 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:58,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:56:58,324 INFO L93 Difference]: Finished difference Result 28415 states and 42426 transitions. [2024-11-11 22:56:58,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:56:58,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:56:58,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:56:58,396 INFO L225 Difference]: With dead ends: 28415 [2024-11-11 22:56:58,396 INFO L226 Difference]: Without dead ends: 22138 [2024-11-11 22:56:58,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:56:58,425 INFO L435 NwaCegarLoop]: 258 mSDtfsCounter, 1200 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 1704 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 22:56:58,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 1156 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1704 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 22:56:58,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22138 states. [2024-11-11 22:56:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22138 to 16495. [2024-11-11 22:56:59,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16495 states, 14210 states have (on average 1.4372976776917663) internal successors, (20424), 14340 states have internal predecessors, (20424), 1317 states have call successors, (1317), 780 states have call predecessors, (1317), 966 states have return successors, (2311), 1444 states have call predecessors, (2311), 1316 states have call successors, (2311) [2024-11-11 22:56:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16495 states to 16495 states and 24052 transitions. [2024-11-11 22:56:59,929 INFO L78 Accepts]: Start accepts. Automaton has 16495 states and 24052 transitions. Word has length 101 [2024-11-11 22:56:59,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:56:59,929 INFO L471 AbstractCegarLoop]: Abstraction has 16495 states and 24052 transitions. [2024-11-11 22:56:59,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:56:59,930 INFO L276 IsEmpty]: Start isEmpty. Operand 16495 states and 24052 transitions. [2024-11-11 22:56:59,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:56:59,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:56:59,939 INFO L218 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] [2024-11-11 22:56:59,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 22:56:59,939 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:56:59,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:56:59,940 INFO L85 PathProgramCache]: Analyzing trace with hash -65940690, now seen corresponding path program 1 times [2024-11-11 22:56:59,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:56:59,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813036996] [2024-11-11 22:56:59,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:56:59,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:56:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:56:59,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:56:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:00,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:57:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:00,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:57:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:00,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:57:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:57:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:00,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:00,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813036996] [2024-11-11 22:57:00,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813036996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:00,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:00,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:57:00,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204095847] [2024-11-11 22:57:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:00,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:57:00,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:00,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:57:00,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:57:00,076 INFO L87 Difference]: Start difference. First operand 16495 states and 24052 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:57:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:04,146 INFO L93 Difference]: Finished difference Result 50350 states and 77184 transitions. [2024-11-11 22:57:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:57:04,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:57:04,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:04,254 INFO L225 Difference]: With dead ends: 50350 [2024-11-11 22:57:04,254 INFO L226 Difference]: Without dead ends: 38200 [2024-11-11 22:57:04,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:57:04,291 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1026 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 2135 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 2135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:04,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 1605 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 2135 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:57:04,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38200 states. [2024-11-11 22:57:06,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38200 to 28368. [2024-11-11 22:57:06,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28368 states, 24867 states have (on average 1.469980295170306) internal successors, (36554), 25061 states have internal predecessors, (36554), 2085 states have call successors, (2085), 1164 states have call predecessors, (2085), 1414 states have return successors, (4601), 2276 states have call predecessors, (4601), 2084 states have call successors, (4601) [2024-11-11 22:57:06,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28368 states to 28368 states and 43240 transitions. [2024-11-11 22:57:06,773 INFO L78 Accepts]: Start accepts. Automaton has 28368 states and 43240 transitions. Word has length 101 [2024-11-11 22:57:06,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:06,773 INFO L471 AbstractCegarLoop]: Abstraction has 28368 states and 43240 transitions. [2024-11-11 22:57:06,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:57:06,773 INFO L276 IsEmpty]: Start isEmpty. Operand 28368 states and 43240 transitions. [2024-11-11 22:57:06,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:57:06,792 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:06,792 INFO L218 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] [2024-11-11 22:57:06,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-11 22:57:06,793 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:06,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:06,793 INFO L85 PathProgramCache]: Analyzing trace with hash -38875088, now seen corresponding path program 1 times [2024-11-11 22:57:06,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:06,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107545641] [2024-11-11 22:57:06,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:06,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:06,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:06,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:57:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:06,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:57:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:06,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:57:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:06,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:57:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:06,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:06,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:06,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107545641] [2024-11-11 22:57:06,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107545641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:06,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:06,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:57:06,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717557823] [2024-11-11 22:57:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:06,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:57:06,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:06,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:57:06,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:57:06,922 INFO L87 Difference]: Start difference. First operand 28368 states and 43240 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:57:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:57:13,133 INFO L93 Difference]: Finished difference Result 91531 states and 144642 transitions. [2024-11-11 22:57:13,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:57:13,134 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 101 [2024-11-11 22:57:13,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:57:13,401 INFO L225 Difference]: With dead ends: 91531 [2024-11-11 22:57:13,401 INFO L226 Difference]: Without dead ends: 67508 [2024-11-11 22:57:13,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:57:13,479 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 1045 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:57:13,479 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1605 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:57:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67508 states. [2024-11-11 22:57:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67508 to 52178. [2024-11-11 22:57:18,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52178 states, 46309 states have (on average 1.4928847524239348) internal successors, (69134), 46631 states have internal predecessors, (69134), 3557 states have call successors, (3557), 1932 states have call predecessors, (3557), 2310 states have return successors, (10575), 3876 states have call predecessors, (10575), 3556 states have call successors, (10575) [2024-11-11 22:57:18,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52178 states to 52178 states and 83266 transitions. [2024-11-11 22:57:18,391 INFO L78 Accepts]: Start accepts. Automaton has 52178 states and 83266 transitions. Word has length 101 [2024-11-11 22:57:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:57:18,392 INFO L471 AbstractCegarLoop]: Abstraction has 52178 states and 83266 transitions. [2024-11-11 22:57:18,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:57:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 52178 states and 83266 transitions. [2024-11-11 22:57:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 22:57:18,419 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:57:18,419 INFO L218 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] [2024-11-11 22:57:18,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-11 22:57:18,419 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:57:18,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:57:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1695229362, now seen corresponding path program 1 times [2024-11-11 22:57:18,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:57:18,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860475716] [2024-11-11 22:57:18,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:57:18,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:57:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:57:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:18,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 22:57:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 22:57:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:18,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 22:57:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 22:57:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:57:18,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:57:18,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:57:18,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860475716] [2024-11-11 22:57:18,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860475716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:57:18,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:57:18,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:57:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752385483] [2024-11-11 22:57:18,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:57:18,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:57:18,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:57:18,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:57:18,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:57:18,739 INFO L87 Difference]: Start difference. First operand 52178 states and 83266 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)