./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.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 c169527384ebd2beb44494ef6b1cbc32334198d2b76d2236e6ced79c84ed026c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:18:34,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:18:34,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:18:34,453 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:18:34,453 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:18:34,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:18:34,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:18:34,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:18:34,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:18:34,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:18:34,476 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:18:34,476 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:18:34,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:18:34,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:18:34,478 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:18:34,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:18:34,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:18:34,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:18:34,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:18:34,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:18:34,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:18:34,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:18:34,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:18:34,481 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:18:34,481 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:18:34,482 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:18:34,482 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:18:34,482 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:18:34,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:18:34,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:18:34,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:18:34,483 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:18:34,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:18:34,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:18:34,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:18:34,485 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:18:34,485 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:18:34,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:18:34,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:18:34,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:18:34,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:18:34,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:18:34,487 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 -> c169527384ebd2beb44494ef6b1cbc32334198d2b76d2236e6ced79c84ed026c [2024-10-12 19:18:34,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:18:34,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:18:34,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:18:34,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:18:34,822 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:18:34,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.c [2024-10-12 19:18:36,281 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:18:36,607 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:18:36,608 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.c [2024-10-12 19:18:36,628 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faed6bb7b/1f3e8fb97d64475295d31c2cd863b146/FLAGdecf32036 [2024-10-12 19:18:36,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faed6bb7b/1f3e8fb97d64475295d31c2cd863b146 [2024-10-12 19:18:36,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:18:36,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:18:36,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:18:36,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:18:36,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:18:36,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:18:36" (1/1) ... [2024-10-12 19:18:36,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50fd129f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:36, skipping insertion in model container [2024-10-12 19:18:36,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:18:36" (1/1) ... [2024-10-12 19:18:36,719 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:18:36,973 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.c[5770,5783] [2024-10-12 19:18:37,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:18:37,281 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:18:37,292 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-10-12 19:18:37,294 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [67] [2024-10-12 19:18:37,294 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [259] [2024-10-12 19:18:37,294 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [268] [2024-10-12 19:18:37,294 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [366] [2024-10-12 19:18:37,294 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1033] [2024-10-12 19:18:37,295 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1399] [2024-10-12 19:18:37,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2844] [2024-10-12 19:18:37,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3195] [2024-10-12 19:18:37,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3313] [2024-10-12 19:18:37,307 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product17.cil.c[5770,5783] [2024-10-12 19:18:37,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:18:37,456 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:18:37,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37 WrapperNode [2024-10-12 19:18:37,457 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:18:37,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:18:37,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:18:37,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:18:37,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,555 INFO L138 Inliner]: procedures = 88, calls = 338, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 797 [2024-10-12 19:18:37,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:18:37,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:18:37,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:18:37,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:18:37,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,618 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-12 19:18:37,622 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,653 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,677 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:18:37,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:18:37,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:18:37,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:18:37,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (1/1) ... [2024-10-12 19:18:37,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:18:37,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:18:37,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:18:37,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:18:37,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:18:37,806 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-12 19:18:37,806 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-12 19:18:37,806 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-12 19:18:37,806 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-12 19:18:37,807 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-12 19:18:37,807 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-12 19:18:37,807 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-12 19:18:37,807 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-12 19:18:37,808 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-12 19:18:37,808 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-12 19:18:37,808 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-12 19:18:37,808 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-12 19:18:37,808 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:18:37,809 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:18:37,809 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:18:37,810 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:18:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:18:37,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:18:37,810 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-12 19:18:37,811 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-12 19:18:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-12 19:18:37,811 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-12 19:18:37,811 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-12 19:18:37,811 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-12 19:18:37,812 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-12 19:18:37,813 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-12 19:18:37,813 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-12 19:18:37,813 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-12 19:18:37,813 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-12 19:18:37,813 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-12 19:18:37,813 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-12 19:18:37,813 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-12 19:18:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-12 19:18:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-12 19:18:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-12 19:18:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-12 19:18:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-12 19:18:37,814 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-12 19:18:37,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:18:37,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:18:37,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:18:37,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:18:37,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 19:18:37,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 19:18:37,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 19:18:37,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 19:18:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 19:18:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 19:18:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 19:18:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 19:18:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 19:18:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 19:18:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 19:18:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 19:18:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 19:18:37,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-12 19:18:37,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-12 19:18:37,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-12 19:18:37,818 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-12 19:18:37,818 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-12 19:18:37,818 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-12 19:18:37,818 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-12 19:18:37,818 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-12 19:18:37,818 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-12 19:18:37,818 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-12 19:18:37,818 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-12 19:18:37,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:18:37,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:18:37,819 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-12 19:18:37,819 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-12 19:18:38,089 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:18:38,092 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:18:39,386 INFO L? ?]: Removed 435 outVars from TransFormulas that were not future-live. [2024-10-12 19:18:39,386 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:18:39,475 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:18:39,476 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:18:39,476 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:18:39 BoogieIcfgContainer [2024-10-12 19:18:39,476 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:18:39,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:18:39,482 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:18:39,485 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:18:39,486 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:18:36" (1/3) ... [2024-10-12 19:18:39,487 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3339d76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:18:39, skipping insertion in model container [2024-10-12 19:18:39,487 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:37" (2/3) ... [2024-10-12 19:18:39,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3339d76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:18:39, skipping insertion in model container [2024-10-12 19:18:39,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:18:39" (3/3) ... [2024-10-12 19:18:39,490 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product17.cil.c [2024-10-12 19:18:39,506 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:18:39,506 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:18:39,600 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:18:39,609 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;@482477da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:18:39,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:18:39,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 540 states, 414 states have (on average 1.7222222222222223) internal successors, (713), 432 states have internal predecessors, (713), 100 states have call successors, (100), 24 states have call predecessors, (100), 24 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-12 19:18:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-12 19:18:39,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:39,641 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:39,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:39,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1984493230, now seen corresponding path program 1 times [2024-10-12 19:18:39,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:39,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868533844] [2024-10-12 19:18:39,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:40,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:40,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:18:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:40,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:40,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:18:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:41,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:18:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:41,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:18:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:41,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:18:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:41,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:18:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:41,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:18:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:18:41,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:41,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868533844] [2024-10-12 19:18:41,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868533844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:41,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:41,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:18:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878053558] [2024-10-12 19:18:41,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:41,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:18:41,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:41,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:18:41,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:18:41,101 INFO L87 Difference]: Start difference. First operand has 540 states, 414 states have (on average 1.7222222222222223) internal successors, (713), 432 states have internal predecessors, (713), 100 states have call successors, (100), 24 states have call predecessors, (100), 24 states have return successors, (100), 97 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:18:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:49,351 INFO L93 Difference]: Finished difference Result 1418 states and 2501 transitions. [2024-10-12 19:18:49,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:18:49,354 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 75 [2024-10-12 19:18:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:49,387 INFO L225 Difference]: With dead ends: 1418 [2024-10-12 19:18:49,387 INFO L226 Difference]: Without dead ends: 875 [2024-10-12 19:18:49,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:18:49,407 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 2160 mSDsluCounter, 2399 mSDsCounter, 0 mSdLazyCounter, 5325 mSolverCounterSat, 657 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2265 SdHoareTripleChecker+Valid, 2849 SdHoareTripleChecker+Invalid, 5982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 657 IncrementalHoareTripleChecker+Valid, 5325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:49,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2265 Valid, 2849 Invalid, 5982 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [657 Valid, 5325 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-12 19:18:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-12 19:18:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 546. [2024-10-12 19:18:49,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 420 states have (on average 1.707142857142857) internal successors, (717), 438 states have internal predecessors, (717), 101 states have call successors, (101), 24 states have call predecessors, (101), 24 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-10-12 19:18:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 918 transitions. [2024-10-12 19:18:49,679 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 918 transitions. Word has length 75 [2024-10-12 19:18:49,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:49,680 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 918 transitions. [2024-10-12 19:18:49,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.777777777777778) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:18:49,681 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 918 transitions. [2024-10-12 19:18:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 19:18:49,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:49,688 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:49,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:18:49,689 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:49,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:49,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1486008158, now seen corresponding path program 1 times [2024-10-12 19:18:49,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:49,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091797940] [2024-10-12 19:18:49,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:49,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:50,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:50,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:50,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:18:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:50,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:50,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:18:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:50,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:18:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:18:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:18:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:50,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:18:50,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:50,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:18:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:18:50,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:50,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091797940] [2024-10-12 19:18:50,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091797940] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:50,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:50,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:18:50,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497708188] [2024-10-12 19:18:50,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:50,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:18:50,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:50,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:18:50,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:18:50,413 INFO L87 Difference]: Start difference. First operand 546 states and 918 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:18:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:57,250 INFO L93 Difference]: Finished difference Result 1411 states and 2450 transitions. [2024-10-12 19:18:57,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:18:57,251 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 76 [2024-10-12 19:18:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:57,262 INFO L225 Difference]: With dead ends: 1411 [2024-10-12 19:18:57,262 INFO L226 Difference]: Without dead ends: 875 [2024-10-12 19:18:57,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:18:57,269 INFO L432 NwaCegarLoop]: 433 mSDtfsCounter, 1052 mSDsluCounter, 2374 mSDsCounter, 0 mSdLazyCounter, 5406 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 2807 SdHoareTripleChecker+Invalid, 5683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 5406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:57,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 2807 Invalid, 5683 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [277 Valid, 5406 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-10-12 19:18:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-12 19:18:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 546. [2024-10-12 19:18:57,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 420 states have (on average 1.7047619047619047) internal successors, (716), 438 states have internal predecessors, (716), 101 states have call successors, (101), 24 states have call predecessors, (101), 24 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-10-12 19:18:57,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 917 transitions. [2024-10-12 19:18:57,412 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 917 transitions. Word has length 76 [2024-10-12 19:18:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:57,413 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 917 transitions. [2024-10-12 19:18:57,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:18:57,413 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 917 transitions. [2024-10-12 19:18:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-12 19:18:57,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:57,417 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:57,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:18:57,417 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:57,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:57,418 INFO L85 PathProgramCache]: Analyzing trace with hash 25252281, now seen corresponding path program 1 times [2024-10-12 19:18:57,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:57,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797030601] [2024-10-12 19:18:57,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:57,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:57,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:57,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:57,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:18:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:57,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:57,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:18:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:18:58,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:18:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:18:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:18:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:18:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:18:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:58,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797030601] [2024-10-12 19:18:58,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797030601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:58,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:58,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:18:58,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544943338] [2024-10-12 19:18:58,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:58,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:18:58,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:58,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:18:58,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:58,035 INFO L87 Difference]: Start difference. First operand 546 states and 917 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:19:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:02,969 INFO L93 Difference]: Finished difference Result 1405 states and 2433 transitions. [2024-10-12 19:19:02,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:19:02,970 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 76 [2024-10-12 19:19:02,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:02,977 INFO L225 Difference]: With dead ends: 1405 [2024-10-12 19:19:02,977 INFO L226 Difference]: Without dead ends: 840 [2024-10-12 19:19:02,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:19:02,982 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 1555 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 2831 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1659 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 2831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:02,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1659 Valid, 1462 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 2831 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-12 19:19:02,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-10-12 19:19:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 523. [2024-10-12 19:19:03,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 400 states have (on average 1.695) internal successors, (678), 416 states have internal predecessors, (678), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-12 19:19:03,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 875 transitions. [2024-10-12 19:19:03,104 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 875 transitions. Word has length 76 [2024-10-12 19:19:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:03,104 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 875 transitions. [2024-10-12 19:19:03,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:19:03,105 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 875 transitions. [2024-10-12 19:19:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-12 19:19:03,107 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:03,107 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:03,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:19:03,107 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:03,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1640512262, now seen corresponding path program 1 times [2024-10-12 19:19:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:03,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224964390] [2024-10-12 19:19:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:03,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:03,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:03,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:03,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:03,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:03,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:03,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:03,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:19:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:03,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:19:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:03,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:19:03,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:03,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:19:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:03,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:19:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:03,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:03,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224964390] [2024-10-12 19:19:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224964390] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:03,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:03,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333447566] [2024-10-12 19:19:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:03,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:03,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:03,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:03,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:03,780 INFO L87 Difference]: Start difference. First operand 523 states and 875 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:10,148 INFO L93 Difference]: Finished difference Result 1369 states and 2365 transitions. [2024-10-12 19:19:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:19:10,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2024-10-12 19:19:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:10,154 INFO L225 Difference]: With dead ends: 1369 [2024-10-12 19:19:10,155 INFO L226 Difference]: Without dead ends: 834 [2024-10-12 19:19:10,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:19:10,162 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 1567 mSDsluCounter, 2361 mSDsCounter, 0 mSdLazyCounter, 5124 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 2799 SdHoareTripleChecker+Invalid, 5593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 5124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:10,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 2799 Invalid, 5593 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [469 Valid, 5124 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-12 19:19:10,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-12 19:19:10,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 517. [2024-10-12 19:19:10,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 394 states have (on average 1.6878172588832487) internal successors, (665), 410 states have internal predecessors, (665), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-12 19:19:10,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 862 transitions. [2024-10-12 19:19:10,288 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 862 transitions. Word has length 77 [2024-10-12 19:19:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:10,288 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 862 transitions. [2024-10-12 19:19:10,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 862 transitions. [2024-10-12 19:19:10,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-12 19:19:10,291 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:10,291 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:10,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:19:10,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:10,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:10,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1083816198, now seen corresponding path program 1 times [2024-10-12 19:19:10,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:10,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939102896] [2024-10-12 19:19:10,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:10,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:19:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-12 19:19:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:19:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:19:10,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:19:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:10,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:10,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939102896] [2024-10-12 19:19:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939102896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:10,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:10,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:19:10,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398813815] [2024-10-12 19:19:10,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:10,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:19:10,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:10,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:19:10,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:19:10,834 INFO L87 Difference]: Start difference. First operand 517 states and 862 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:19:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:15,680 INFO L93 Difference]: Finished difference Result 1341 states and 2316 transitions. [2024-10-12 19:19:15,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:19:15,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 78 [2024-10-12 19:19:15,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:15,688 INFO L225 Difference]: With dead ends: 1341 [2024-10-12 19:19:15,689 INFO L226 Difference]: Without dead ends: 834 [2024-10-12 19:19:15,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:19:15,694 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 993 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 3067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:15,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1521 Invalid, 3067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-12 19:19:15,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2024-10-12 19:19:15,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 517. [2024-10-12 19:19:15,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 394 states have (on average 1.6852791878172588) internal successors, (664), 410 states have internal predecessors, (664), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-12 19:19:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 861 transitions. [2024-10-12 19:19:15,855 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 861 transitions. Word has length 78 [2024-10-12 19:19:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:15,856 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 861 transitions. [2024-10-12 19:19:15,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:19:15,856 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 861 transitions. [2024-10-12 19:19:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-12 19:19:15,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:15,859 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:15,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:19:15,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:15,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2033674199, now seen corresponding path program 1 times [2024-10-12 19:19:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829581821] [2024-10-12 19:19:15,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:16,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:16,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:16,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:16,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:16,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:16,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:19:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:16,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:19:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:16,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:19:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:16,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:19:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:16,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:19:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:16,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:16,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829581821] [2024-10-12 19:19:16,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829581821] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:16,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:16,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:16,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622793881] [2024-10-12 19:19:16,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:16,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:16,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:16,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:16,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:16,518 INFO L87 Difference]: Start difference. First operand 517 states and 861 transitions. Second operand has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:22,664 INFO L93 Difference]: Finished difference Result 1357 states and 2334 transitions. [2024-10-12 19:19:22,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:19:22,665 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 79 [2024-10-12 19:19:22,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:22,670 INFO L225 Difference]: With dead ends: 1357 [2024-10-12 19:19:22,671 INFO L226 Difference]: Without dead ends: 828 [2024-10-12 19:19:22,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:19:22,676 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 1530 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 5031 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1635 SdHoareTripleChecker+Valid, 2786 SdHoareTripleChecker+Invalid, 5502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 5031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:22,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1635 Valid, 2786 Invalid, 5502 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [471 Valid, 5031 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-12 19:19:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-10-12 19:19:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 511. [2024-10-12 19:19:22,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 388 states have (on average 1.6778350515463918) internal successors, (651), 404 states have internal predecessors, (651), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-12 19:19:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 848 transitions. [2024-10-12 19:19:22,800 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 848 transitions. Word has length 79 [2024-10-12 19:19:22,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:22,800 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 848 transitions. [2024-10-12 19:19:22,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:22,800 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 848 transitions. [2024-10-12 19:19:22,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-12 19:19:22,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:22,802 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:22,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:19:22,803 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:22,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:22,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1404947719, now seen corresponding path program 1 times [2024-10-12 19:19:22,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:22,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038907695] [2024-10-12 19:19:22,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:22,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:19:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:19:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:19:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:19:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:19:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:23,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:23,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038907695] [2024-10-12 19:19:23,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038907695] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:23,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:23,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:19:23,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672561859] [2024-10-12 19:19:23,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:23,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:19:23,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:23,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:19:23,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:19:23,410 INFO L87 Difference]: Start difference. First operand 511 states and 848 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:19:28,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:28,287 INFO L93 Difference]: Finished difference Result 1329 states and 2287 transitions. [2024-10-12 19:19:28,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:19:28,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 80 [2024-10-12 19:19:28,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:28,293 INFO L225 Difference]: With dead ends: 1329 [2024-10-12 19:19:28,293 INFO L226 Difference]: Without dead ends: 828 [2024-10-12 19:19:28,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:19:28,297 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 958 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 2779 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 3050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:28,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1556 Invalid, 3050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2779 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-12 19:19:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-10-12 19:19:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 511. [2024-10-12 19:19:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 388 states have (on average 1.675257731958763) internal successors, (650), 404 states have internal predecessors, (650), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-12 19:19:28,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 847 transitions. [2024-10-12 19:19:28,428 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 847 transitions. Word has length 80 [2024-10-12 19:19:28,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:28,428 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 847 transitions. [2024-10-12 19:19:28,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:19:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 847 transitions. [2024-10-12 19:19:28,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:19:28,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:28,431 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:28,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:19:28,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:28,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:28,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1933882501, now seen corresponding path program 1 times [2024-10-12 19:19:28,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:28,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871693069] [2024-10-12 19:19:28,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:28,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:28,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:28,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:28,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:28,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:28,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:28,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:19:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:19:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:19:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:19:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:19:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:29,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:29,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:29,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871693069] [2024-10-12 19:19:29,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871693069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:29,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:29,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:29,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868961842] [2024-10-12 19:19:29,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:29,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:29,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:29,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:29,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:29,064 INFO L87 Difference]: Start difference. First operand 511 states and 847 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:35,024 INFO L93 Difference]: Finished difference Result 1345 states and 2303 transitions. [2024-10-12 19:19:35,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:19:35,025 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2024-10-12 19:19:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:35,030 INFO L225 Difference]: With dead ends: 1345 [2024-10-12 19:19:35,030 INFO L226 Difference]: Without dead ends: 822 [2024-10-12 19:19:35,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:19:35,034 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1484 mSDsluCounter, 2415 mSDsCounter, 0 mSdLazyCounter, 5013 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1589 SdHoareTripleChecker+Valid, 2864 SdHoareTripleChecker+Invalid, 5474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 5013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:35,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1589 Valid, 2864 Invalid, 5474 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [461 Valid, 5013 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-12 19:19:35,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-12 19:19:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 505. [2024-10-12 19:19:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 382 states have (on average 1.6675392670157068) internal successors, (637), 398 states have internal predecessors, (637), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-12 19:19:35,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 834 transitions. [2024-10-12 19:19:35,165 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 834 transitions. Word has length 81 [2024-10-12 19:19:35,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:35,165 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 834 transitions. [2024-10-12 19:19:35,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:35,165 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 834 transitions. [2024-10-12 19:19:35,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-12 19:19:35,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:35,167 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:35,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:19:35,168 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:35,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash 155887194, now seen corresponding path program 1 times [2024-10-12 19:19:35,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:35,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169815296] [2024-10-12 19:19:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:35,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:35,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:35,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:35,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:35,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:35,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:35,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:19:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:35,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:19:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:35,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:19:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:35,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:19:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:35,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:19:35,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:35,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:35,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169815296] [2024-10-12 19:19:35,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169815296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:35,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:35,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:35,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135640656] [2024-10-12 19:19:35,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:35,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:35,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:35,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:35,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:35,726 INFO L87 Difference]: Start difference. First operand 505 states and 834 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:41,785 INFO L93 Difference]: Finished difference Result 1317 states and 2258 transitions. [2024-10-12 19:19:41,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:19:41,786 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2024-10-12 19:19:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:41,792 INFO L225 Difference]: With dead ends: 1317 [2024-10-12 19:19:41,792 INFO L226 Difference]: Without dead ends: 822 [2024-10-12 19:19:41,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:19:41,795 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 937 mSDsluCounter, 2375 mSDsCounter, 0 mSdLazyCounter, 4916 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1041 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 5188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 4916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:41,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1041 Valid, 2809 Invalid, 5188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 4916 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-12 19:19:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-12 19:19:41,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 505. [2024-10-12 19:19:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 382 states have (on average 1.6649214659685865) internal successors, (636), 398 states have internal predecessors, (636), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-12 19:19:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 833 transitions. [2024-10-12 19:19:41,960 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 833 transitions. Word has length 81 [2024-10-12 19:19:41,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:41,960 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 833 transitions. [2024-10-12 19:19:41,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:41,961 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 833 transitions. [2024-10-12 19:19:41,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 19:19:41,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:41,962 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:41,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:19:41,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:41,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:41,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1257182221, now seen corresponding path program 1 times [2024-10-12 19:19:41,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:41,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558138003] [2024-10-12 19:19:41,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:41,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:19:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:19:42,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:19:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:19:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:19:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:42,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:42,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558138003] [2024-10-12 19:19:42,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558138003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:42,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:42,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:19:42,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689885953] [2024-10-12 19:19:42,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:42,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:19:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:42,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:19:42,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:19:42,487 INFO L87 Difference]: Start difference. First operand 505 states and 833 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:19:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:47,196 INFO L93 Difference]: Finished difference Result 1323 states and 2262 transitions. [2024-10-12 19:19:47,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-12 19:19:47,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2024-10-12 19:19:47,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:47,204 INFO L225 Difference]: With dead ends: 1323 [2024-10-12 19:19:47,204 INFO L226 Difference]: Without dead ends: 828 [2024-10-12 19:19:47,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:47,207 INFO L432 NwaCegarLoop]: 435 mSDtfsCounter, 925 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 2710 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1030 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:47,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1030 Valid, 1548 Invalid, 2980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2710 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-12 19:19:47,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2024-10-12 19:19:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 511. [2024-10-12 19:19:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 388 states have (on average 1.6546391752577319) internal successors, (642), 404 states have internal predecessors, (642), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-12 19:19:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 839 transitions. [2024-10-12 19:19:47,393 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 839 transitions. Word has length 82 [2024-10-12 19:19:47,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:47,393 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 839 transitions. [2024-10-12 19:19:47,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-12 19:19:47,393 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 839 transitions. [2024-10-12 19:19:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-12 19:19:47,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:47,395 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:47,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:19:47,396 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:47,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1701082895, now seen corresponding path program 1 times [2024-10-12 19:19:47,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:47,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190594883] [2024-10-12 19:19:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:47,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:47,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:47,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:47,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:47,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:47,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:47,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:47,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:19:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:47,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:19:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:47,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:19:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:47,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:19:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:47,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:19:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-12 19:19:47,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:47,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190594883] [2024-10-12 19:19:47,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190594883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:47,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:47,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448847069] [2024-10-12 19:19:47,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:47,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:47,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:47,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:47,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:47,983 INFO L87 Difference]: Start difference. First operand 511 states and 839 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:54,103 INFO L93 Difference]: Finished difference Result 1331 states and 2268 transitions. [2024-10-12 19:19:54,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:19:54,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 82 [2024-10-12 19:19:54,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:54,109 INFO L225 Difference]: With dead ends: 1331 [2024-10-12 19:19:54,110 INFO L226 Difference]: Without dead ends: 822 [2024-10-12 19:19:54,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:19:54,113 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 953 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 4890 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 2724 SdHoareTripleChecker+Invalid, 5165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 4890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:54,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 2724 Invalid, 5165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 4890 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-12 19:19:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-10-12 19:19:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 505. [2024-10-12 19:19:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 382 states have (on average 1.662303664921466) internal successors, (635), 398 states have internal predecessors, (635), 100 states have call successors, (100), 24 states have call predecessors, (100), 22 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-10-12 19:19:54,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 832 transitions. [2024-10-12 19:19:54,271 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 832 transitions. Word has length 82 [2024-10-12 19:19:54,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:54,271 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 832 transitions. [2024-10-12 19:19:54,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:54,272 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 832 transitions. [2024-10-12 19:19:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-12 19:19:54,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:54,273 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:54,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:19:54,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:54,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:54,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1931662592, now seen corresponding path program 1 times [2024-10-12 19:19:54,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:54,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976882407] [2024-10-12 19:19:54,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:54,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:54,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:54,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:54,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:54,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:54,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:54,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:54,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:54,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:19:54,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:54,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:19:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:54,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:19:54,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:54,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:19:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:54,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:19:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-12 19:19:54,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976882407] [2024-10-12 19:19:54,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976882407] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:19:54,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079453580] [2024-10-12 19:19:54,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:54,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:19:54,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:19:54,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:19:54,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:19:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:55,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 1532 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:19:55,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:19:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 19:19:55,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:19:55,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079453580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:55,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:19:55,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-12 19:19:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218440906] [2024-10-12 19:19:55,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:55,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:19:55,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:19:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:55,176 INFO L87 Difference]: Start difference. First operand 505 states and 832 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:55,437 INFO L93 Difference]: Finished difference Result 1440 states and 2399 transitions. [2024-10-12 19:19:55,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:19:55,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 83 [2024-10-12 19:19:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:55,443 INFO L225 Difference]: With dead ends: 1440 [2024-10-12 19:19:55,443 INFO L226 Difference]: Without dead ends: 947 [2024-10-12 19:19:55,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:55,447 INFO L432 NwaCegarLoop]: 827 mSDtfsCounter, 777 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:55,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1553 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:19:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-10-12 19:19:55,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 933. [2024-10-12 19:19:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 714 states have (on average 1.6722689075630253) internal successors, (1194), 745 states have internal predecessors, (1194), 176 states have call successors, (176), 43 states have call predecessors, (176), 42 states have return successors, (178), 170 states have call predecessors, (178), 173 states have call successors, (178) [2024-10-12 19:19:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1548 transitions. [2024-10-12 19:19:55,675 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1548 transitions. Word has length 83 [2024-10-12 19:19:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:55,675 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1548 transitions. [2024-10-12 19:19:55,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-12 19:19:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1548 transitions. [2024-10-12 19:19:55,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-12 19:19:55,679 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:55,679 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]