./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_spec9_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_spec9_product30.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 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:46:55,097 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:46:55,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:46:55,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:46:55,164 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:46:55,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:46:55,186 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:46:55,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:46:55,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:46:55,187 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:46:55,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:46:55,187 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:46:55,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:46:55,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:46:55,188 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:46:55,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:46:55,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:46:55,189 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:46:55,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:46:55,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:46:55,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:46:55,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:46:55,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:46:55,192 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:46:55,193 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:46:55,193 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:46:55,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:46:55,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:46:55,193 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:46:55,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:46:55,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:46:55,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:46:55,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:46:55,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:46:55,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:46:55,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:46:55,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:46:55,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:46:55,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:46:55,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:46:55,197 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:46:55,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:46:55,198 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 -> 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e [2024-11-19 21:46:55,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:46:55,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:46:55,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:46:55,407 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:46:55,408 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:46:55,408 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2024-11-19 21:46:56,599 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:46:56,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:46:56,834 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2024-11-19 21:46:56,851 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4ea3077/7ada663e8068426a81820afd8e002081/FLAG9c39df566 [2024-11-19 21:46:56,862 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed4ea3077/7ada663e8068426a81820afd8e002081 [2024-11-19 21:46:56,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:46:56,866 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:46:56,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:46:56,869 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:46:56,872 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:46:56,873 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:46:56" (1/1) ... [2024-11-19 21:46:56,874 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@407b2896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:56, skipping insertion in model container [2024-11-19 21:46:56,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:46:56" (1/1) ... [2024-11-19 21:46:56,921 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:46:57,179 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c[11768,11781] [2024-11-19 21:46:57,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:46:57,339 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:46:57,345 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2024-11-19 21:46:57,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [414] [2024-11-19 21:46:57,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [452] [2024-11-19 21:46:57,347 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [461] [2024-11-19 21:46:57,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [626] [2024-11-19 21:46:57,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [640] [2024-11-19 21:46:57,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [739] [2024-11-19 21:46:57,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [859] [2024-11-19 21:46:57,348 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2444] [2024-11-19 21:46:57,349 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3105] [2024-11-19 21:46:57,368 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c[11768,11781] [2024-11-19 21:46:57,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:46:57,433 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:46:57,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57 WrapperNode [2024-11-19 21:46:57,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:46:57,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:46:57,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:46:57,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:46:57,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,491 INFO L138 Inliner]: procedures = 95, calls = 344, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 872 [2024-11-19 21:46:57,491 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:46:57,492 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:46:57,492 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:46:57,492 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:46:57,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,535 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-11-19 21:46:57,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,602 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:46:57,604 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:46:57,604 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:46:57,604 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:46:57,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (1/1) ... [2024-11-19 21:46:57,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:46:57,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:46:57,641 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 21:46:57,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 21:46:57,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:46:57,680 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-19 21:46:57,680 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-19 21:46:57,680 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-19 21:46:57,680 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-19 21:46:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-19 21:46:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-19 21:46:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-19 21:46:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-19 21:46:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-19 21:46:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-19 21:46:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-11-19 21:46:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-11-19 21:46:57,681 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 21:46:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 21:46:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 21:46:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 21:46:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-11-19 21:46:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-11-19 21:46:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-19 21:46:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-19 21:46:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-19 21:46:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-19 21:46:57,682 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-19 21:46:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-19 21:46:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-19 21:46:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-19 21:46:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-19 21:46:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-19 21:46:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-19 21:46:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-19 21:46:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-19 21:46:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-19 21:46:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-19 21:46:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-19 21:46:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-19 21:46:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-19 21:46:57,683 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-19 21:46:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-19 21:46:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-11-19 21:46:57,684 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-11-19 21:46:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:46:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:46:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:46:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:46:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 21:46:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 21:46:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 21:46:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 21:46:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 21:46:57,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 21:46:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 21:46:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 21:46:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 21:46:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 21:46:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-19 21:46:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-19 21:46:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-19 21:46:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-19 21:46:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-19 21:46:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-19 21:46:57,685 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-11-19 21:46:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-11-19 21:46:57,686 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-19 21:46:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-19 21:46:57,686 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-19 21:46:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-19 21:46:57,686 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-19 21:46:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-19 21:46:57,686 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2024-11-19 21:46:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2024-11-19 21:46:57,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:46:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:46:57,686 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-19 21:46:57,687 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-19 21:46:57,827 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:46:57,830 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:46:58,735 INFO L? ?]: Removed 455 outVars from TransFormulas that were not future-live. [2024-11-19 21:46:58,735 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:46:58,761 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:46:58,764 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:46:58,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:46:58 BoogieIcfgContainer [2024-11-19 21:46:58,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:46:58,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:46:58,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:46:58,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:46:58,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:46:56" (1/3) ... [2024-11-19 21:46:58,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a39aeb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:46:58, skipping insertion in model container [2024-11-19 21:46:58,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:57" (2/3) ... [2024-11-19 21:46:58,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a39aeb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:46:58, skipping insertion in model container [2024-11-19 21:46:58,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:46:58" (3/3) ... [2024-11-19 21:46:58,771 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product30.cil.c [2024-11-19 21:46:58,782 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:46:58,782 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:46:58,845 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:46:58,868 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;@7419abe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:46:58,868 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:46:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 576 states, 452 states have (on average 1.6924778761061947) internal successors, (765), 475 states have internal predecessors, (765), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-19 21:46:58,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 21:46:58,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:46:58,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:46:58,887 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:46:58,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:46:58,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1316381237, now seen corresponding path program 1 times [2024-11-19 21:46:58,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:46:58,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812520213] [2024-11-19 21:46:58,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:46:58,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:46:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:59,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:46:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:59,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:59,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:46:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:59,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 21:46:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:59,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:59,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:46:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:59,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:46:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:46:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:46:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812520213] [2024-11-19 21:46:59,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812520213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:46:59,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:46:59,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:46:59,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572710296] [2024-11-19 21:46:59,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:46:59,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:46:59,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:46:59,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:46:59,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:46:59,860 INFO L87 Difference]: Start difference. First operand has 576 states, 452 states have (on average 1.6924778761061947) internal successors, (765), 475 states have internal predecessors, (765), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:03,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:03,756 INFO L93 Difference]: Finished difference Result 1286 states and 2168 transitions. [2024-11-19 21:47:03,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:47:03,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2024-11-19 21:47:03,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:03,779 INFO L225 Difference]: With dead ends: 1286 [2024-11-19 21:47:03,780 INFO L226 Difference]: Without dead ends: 722 [2024-11-19 21:47:03,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:47:03,789 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 1175 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:03,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 1141 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2641 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 21:47:03,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-11-19 21:47:03,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 568. [2024-11-19 21:47:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 446 states have (on average 1.688340807174888) internal successors, (753), 467 states have internal predecessors, (753), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-19 21:47:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 940 transitions. [2024-11-19 21:47:03,924 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 940 transitions. Word has length 62 [2024-11-19 21:47:03,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:03,924 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 940 transitions. [2024-11-19 21:47:03,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:03,924 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 940 transitions. [2024-11-19 21:47:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-19 21:47:03,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:03,928 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:03,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 21:47:03,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:03,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:03,929 INFO L85 PathProgramCache]: Analyzing trace with hash 2014226098, now seen corresponding path program 1 times [2024-11-19 21:47:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982033390] [2024-11-19 21:47:03,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-19 21:47:04,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:04,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:04,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:04,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:04,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982033390] [2024-11-19 21:47:04,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982033390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:04,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:04,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:04,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225850716] [2024-11-19 21:47:04,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:04,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:04,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:04,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:04,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:04,481 INFO L87 Difference]: Start difference. First operand 568 states and 940 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:07,979 INFO L93 Difference]: Finished difference Result 1272 states and 2134 transitions. [2024-11-19 21:47:07,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:47:07,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 65 [2024-11-19 21:47:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:07,985 INFO L225 Difference]: With dead ends: 1272 [2024-11-19 21:47:07,985 INFO L226 Difference]: Without dead ends: 722 [2024-11-19 21:47:07,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:47:07,988 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 1174 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 2642 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1256 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 2898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 2642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:07,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1256 Valid, 1104 Invalid, 2898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 2642 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 21:47:07,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-11-19 21:47:08,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 568. [2024-11-19 21:47:08,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 446 states have (on average 1.6860986547085202) internal successors, (752), 467 states have internal predecessors, (752), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-19 21:47:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 939 transitions. [2024-11-19 21:47:08,055 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 939 transitions. Word has length 65 [2024-11-19 21:47:08,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:08,055 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 939 transitions. [2024-11-19 21:47:08,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:08,056 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 939 transitions. [2024-11-19 21:47:08,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-19 21:47:08,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:08,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:08,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:47:08,057 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:08,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:08,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1200980869, now seen corresponding path program 1 times [2024-11-19 21:47:08,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:08,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763624354] [2024-11-19 21:47:08,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:08,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:08,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:08,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:08,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:08,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 21:47:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:08,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:08,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:08,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:08,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:08,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:08,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763624354] [2024-11-19 21:47:08,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763624354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:08,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:08,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:08,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049130495] [2024-11-19 21:47:08,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:08,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:08,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:08,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:08,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:08,568 INFO L87 Difference]: Start difference. First operand 568 states and 939 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:11,871 INFO L93 Difference]: Finished difference Result 1272 states and 2133 transitions. [2024-11-19 21:47:11,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:47:11,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2024-11-19 21:47:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:11,876 INFO L225 Difference]: With dead ends: 1272 [2024-11-19 21:47:11,876 INFO L226 Difference]: Without dead ends: 722 [2024-11-19 21:47:11,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:47:11,879 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 700 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:11,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1112 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 21:47:11,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-11-19 21:47:11,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 568. [2024-11-19 21:47:11,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 446 states have (on average 1.6838565022421526) internal successors, (751), 467 states have internal predecessors, (751), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-19 21:47:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 938 transitions. [2024-11-19 21:47:11,942 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 938 transitions. Word has length 66 [2024-11-19 21:47:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:11,942 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 938 transitions. [2024-11-19 21:47:11,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:11,943 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 938 transitions. [2024-11-19 21:47:11,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 21:47:11,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:11,944 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:11,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 21:47:11,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:11,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash 541895310, now seen corresponding path program 1 times [2024-11-19 21:47:11,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:11,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84478177] [2024-11-19 21:47:11,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:12,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:12,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:47:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:12,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:47:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:12,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:12,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:12,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84478177] [2024-11-19 21:47:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84478177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:12,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:12,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568890973] [2024-11-19 21:47:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:12,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:12,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:12,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:12,400 INFO L87 Difference]: Start difference. First operand 568 states and 938 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:15,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:15,768 INFO L93 Difference]: Finished difference Result 1272 states and 2132 transitions. [2024-11-19 21:47:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:47:15,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 67 [2024-11-19 21:47:15,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:15,772 INFO L225 Difference]: With dead ends: 1272 [2024-11-19 21:47:15,773 INFO L226 Difference]: Without dead ends: 722 [2024-11-19 21:47:15,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:47:15,775 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 697 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:15,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1112 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-19 21:47:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2024-11-19 21:47:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 568. [2024-11-19 21:47:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 446 states have (on average 1.6816143497757847) internal successors, (750), 467 states have internal predecessors, (750), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-11-19 21:47:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 937 transitions. [2024-11-19 21:47:15,844 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 937 transitions. Word has length 67 [2024-11-19 21:47:15,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:15,844 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 937 transitions. [2024-11-19 21:47:15,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 937 transitions. [2024-11-19 21:47:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-19 21:47:15,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:15,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:15,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 21:47:15,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:15,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:15,846 INFO L85 PathProgramCache]: Analyzing trace with hash 366792225, now seen corresponding path program 1 times [2024-11-19 21:47:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:15,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479984801] [2024-11-19 21:47:15,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:15,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:15,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:15,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:15,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 21:47:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:47:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:16,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:16,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479984801] [2024-11-19 21:47:16,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479984801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:16,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:16,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:47:16,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566649232] [2024-11-19 21:47:16,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:16,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:47:16,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:16,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:47:16,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:47:16,332 INFO L87 Difference]: Start difference. First operand 568 states and 937 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:20,288 INFO L93 Difference]: Finished difference Result 1278 states and 2145 transitions. [2024-11-19 21:47:20,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:47:20,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 68 [2024-11-19 21:47:20,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:20,292 INFO L225 Difference]: With dead ends: 1278 [2024-11-19 21:47:20,292 INFO L226 Difference]: Without dead ends: 728 [2024-11-19 21:47:20,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:47:20,294 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 698 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 5112 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 5236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 5112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:20,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1973 Invalid, 5236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 5112 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 21:47:20,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2024-11-19 21:47:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 572. [2024-11-19 21:47:20,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 449 states have (on average 1.6748329621380846) internal successors, (752), 470 states have internal predecessors, (752), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2024-11-19 21:47:20,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 941 transitions. [2024-11-19 21:47:20,353 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 941 transitions. Word has length 68 [2024-11-19 21:47:20,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:20,353 INFO L471 AbstractCegarLoop]: Abstraction has 572 states and 941 transitions. [2024-11-19 21:47:20,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 2 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 941 transitions. [2024-11-19 21:47:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 21:47:20,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:20,355 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:20,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 21:47:20,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:20,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:20,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2050407705, now seen corresponding path program 1 times [2024-11-19 21:47:20,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:20,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820654471] [2024-11-19 21:47:20,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:20,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:20,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:47:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 21:47:20,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:20,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:20,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820654471] [2024-11-19 21:47:20,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820654471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:20,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:20,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 21:47:20,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885384176] [2024-11-19 21:47:20,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:20,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 21:47:20,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:20,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 21:47:20,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:47:20,962 INFO L87 Difference]: Start difference. First operand 572 states and 941 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-19 21:47:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:28,462 INFO L93 Difference]: Finished difference Result 1552 states and 2569 transitions. [2024-11-19 21:47:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 21:47:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 75 [2024-11-19 21:47:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:28,468 INFO L225 Difference]: With dead ends: 1552 [2024-11-19 21:47:28,468 INFO L226 Difference]: Without dead ends: 1038 [2024-11-19 21:47:28,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=125, Invalid=805, Unknown=0, NotChecked=0, Total=930 [2024-11-19 21:47:28,471 INFO L432 NwaCegarLoop]: 344 mSDtfsCounter, 1791 mSDsluCounter, 3031 mSDsCounter, 0 mSdLazyCounter, 10716 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1861 SdHoareTripleChecker+Valid, 3375 SdHoareTripleChecker+Invalid, 11066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 10716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:28,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1861 Valid, 3375 Invalid, 11066 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [350 Valid, 10716 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2024-11-19 21:47:28,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-11-19 21:47:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 821. [2024-11-19 21:47:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 647 states have (on average 1.6491499227202473) internal successors, (1067), 668 states have internal predecessors, (1067), 133 states have call successors, (133), 39 states have call predecessors, (133), 40 states have return successors, (136), 127 states have call predecessors, (136), 128 states have call successors, (136) [2024-11-19 21:47:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1336 transitions. [2024-11-19 21:47:28,600 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1336 transitions. Word has length 75 [2024-11-19 21:47:28,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:28,601 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1336 transitions. [2024-11-19 21:47:28,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 10 states have internal predecessors, (54), 3 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-19 21:47:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1336 transitions. [2024-11-19 21:47:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 21:47:28,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:28,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:28,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:47:28,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:28,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:28,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1074794078, now seen corresponding path program 1 times [2024-11-19 21:47:28,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:28,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675663581] [2024-11-19 21:47:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:28,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:28,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:28,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:28,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:47:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:29,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:29,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:29,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675663581] [2024-11-19 21:47:29,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675663581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:29,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:29,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 21:47:29,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645128213] [2024-11-19 21:47:29,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:29,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 21:47:29,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:29,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 21:47:29,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:47:29,161 INFO L87 Difference]: Start difference. First operand 821 states and 1336 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:47:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:35,124 INFO L93 Difference]: Finished difference Result 1807 states and 2974 transitions. [2024-11-19 21:47:35,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-19 21:47:35,124 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 75 [2024-11-19 21:47:35,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:35,152 INFO L225 Difference]: With dead ends: 1807 [2024-11-19 21:47:35,152 INFO L226 Difference]: Without dead ends: 1053 [2024-11-19 21:47:35,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2024-11-19 21:47:35,157 INFO L432 NwaCegarLoop]: 331 mSDtfsCounter, 844 mSDsluCounter, 2914 mSDsCounter, 0 mSdLazyCounter, 8202 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 3245 SdHoareTripleChecker+Invalid, 8322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 8202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:35,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 3245 Invalid, 8322 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [120 Valid, 8202 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-19 21:47:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-19 21:47:35,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 834. [2024-11-19 21:47:35,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 657 states have (on average 1.6468797564687976) internal successors, (1082), 680 states have internal predecessors, (1082), 134 states have call successors, (134), 39 states have call predecessors, (134), 42 states have return successors, (139), 128 states have call predecessors, (139), 129 states have call successors, (139) [2024-11-19 21:47:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1355 transitions. [2024-11-19 21:47:35,277 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1355 transitions. Word has length 75 [2024-11-19 21:47:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:35,277 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1355 transitions. [2024-11-19 21:47:35,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:47:35,278 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1355 transitions. [2024-11-19 21:47:35,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 21:47:35,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:35,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:35,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:47:35,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:35,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:35,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1289554113, now seen corresponding path program 1 times [2024-11-19 21:47:35,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:35,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674789750] [2024-11-19 21:47:35,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:35,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:35,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:35,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:35,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:47:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:35,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:35,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:35,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:35,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:35,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:35,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674789750] [2024-11-19 21:47:35,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674789750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:35,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:35,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:35,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149901490] [2024-11-19 21:47:35,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:35,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:35,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:35,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:35,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:35,690 INFO L87 Difference]: Start difference. First operand 834 states and 1355 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:38,685 INFO L93 Difference]: Finished difference Result 1815 states and 2984 transitions. [2024-11-19 21:47:38,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:47:38,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2024-11-19 21:47:38,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:38,691 INFO L225 Difference]: With dead ends: 1815 [2024-11-19 21:47:38,691 INFO L226 Difference]: Without dead ends: 1043 [2024-11-19 21:47:38,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:38,693 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 756 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 2741 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 2861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:38,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 1132 Invalid, 2861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2741 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 21:47:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2024-11-19 21:47:38,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 834. [2024-11-19 21:47:38,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 657 states have (on average 1.639269406392694) internal successors, (1077), 680 states have internal predecessors, (1077), 134 states have call successors, (134), 39 states have call predecessors, (134), 42 states have return successors, (139), 128 states have call predecessors, (139), 129 states have call successors, (139) [2024-11-19 21:47:38,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1350 transitions. [2024-11-19 21:47:38,832 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1350 transitions. Word has length 75 [2024-11-19 21:47:38,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:38,832 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1350 transitions. [2024-11-19 21:47:38,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:38,833 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1350 transitions. [2024-11-19 21:47:38,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-19 21:47:38,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:38,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:38,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:47:38,835 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:38,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:38,835 INFO L85 PathProgramCache]: Analyzing trace with hash -939425447, now seen corresponding path program 1 times [2024-11-19 21:47:38,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:38,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804510990] [2024-11-19 21:47:38,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:38,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:47:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:39,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:39,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804510990] [2024-11-19 21:47:39,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804510990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:39,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:39,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918837462] [2024-11-19 21:47:39,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:39,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:39,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:39,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:39,234 INFO L87 Difference]: Start difference. First operand 834 states and 1350 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:42,249 INFO L93 Difference]: Finished difference Result 1815 states and 2979 transitions. [2024-11-19 21:47:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:47:42,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 76 [2024-11-19 21:47:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:42,254 INFO L225 Difference]: With dead ends: 1815 [2024-11-19 21:47:42,254 INFO L226 Difference]: Without dead ends: 1043 [2024-11-19 21:47:42,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:42,257 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 755 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 2836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:42,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 1132 Invalid, 2836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 21:47:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2024-11-19 21:47:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 834. [2024-11-19 21:47:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 657 states have (on average 1.6316590563165905) internal successors, (1072), 680 states have internal predecessors, (1072), 134 states have call successors, (134), 39 states have call predecessors, (134), 42 states have return successors, (139), 128 states have call predecessors, (139), 129 states have call successors, (139) [2024-11-19 21:47:42,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1345 transitions. [2024-11-19 21:47:42,390 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1345 transitions. Word has length 76 [2024-11-19 21:47:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:42,390 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1345 transitions. [2024-11-19 21:47:42,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1345 transitions. [2024-11-19 21:47:42,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 21:47:42,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:42,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:42,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:47:42,393 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:42,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:42,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1773951580, now seen corresponding path program 1 times [2024-11-19 21:47:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:42,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751257100] [2024-11-19 21:47:42,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:42,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:42,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:42,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:42,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:42,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:42,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:47:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:42,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:42,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:42,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:42,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:42,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:42,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:42,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751257100] [2024-11-19 21:47:42,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751257100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:42,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:42,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:42,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589804182] [2024-11-19 21:47:42,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:42,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:42,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:42,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:42,806 INFO L87 Difference]: Start difference. First operand 834 states and 1345 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:45,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:45,547 INFO L93 Difference]: Finished difference Result 1815 states and 2974 transitions. [2024-11-19 21:47:45,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:47:45,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2024-11-19 21:47:45,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:45,552 INFO L225 Difference]: With dead ends: 1815 [2024-11-19 21:47:45,552 INFO L226 Difference]: Without dead ends: 1043 [2024-11-19 21:47:45,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:45,555 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 1226 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:45,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 1110 Invalid, 2802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 21:47:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2024-11-19 21:47:45,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 834. [2024-11-19 21:47:45,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 657 states have (on average 1.6240487062404871) internal successors, (1067), 680 states have internal predecessors, (1067), 134 states have call successors, (134), 39 states have call predecessors, (134), 42 states have return successors, (139), 128 states have call predecessors, (139), 129 states have call successors, (139) [2024-11-19 21:47:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1340 transitions. [2024-11-19 21:47:45,689 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1340 transitions. Word has length 77 [2024-11-19 21:47:45,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:45,690 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1340 transitions. [2024-11-19 21:47:45,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:45,690 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1340 transitions. [2024-11-19 21:47:45,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-19 21:47:45,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:45,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:45,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 21:47:45,692 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:45,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:45,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1881942171, now seen corresponding path program 1 times [2024-11-19 21:47:45,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:45,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409667714] [2024-11-19 21:47:45,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:45,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:45,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:45,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:45,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:46,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:47:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:46,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:46,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:46,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:46,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:46,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:46,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:46,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409667714] [2024-11-19 21:47:46,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409667714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:46,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:46,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:47:46,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895999136] [2024-11-19 21:47:46,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:46,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:47:46,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:46,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:47:46,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:47:46,137 INFO L87 Difference]: Start difference. First operand 834 states and 1340 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:47:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:50,217 INFO L93 Difference]: Finished difference Result 1799 states and 2940 transitions. [2024-11-19 21:47:50,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:47:50,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 77 [2024-11-19 21:47:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:50,222 INFO L225 Difference]: With dead ends: 1799 [2024-11-19 21:47:50,223 INFO L226 Difference]: Without dead ends: 1039 [2024-11-19 21:47:50,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:47:50,225 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1207 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 4792 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 5045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 4792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:50,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1961 Invalid, 5045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 4792 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-19 21:47:50,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2024-11-19 21:47:50,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 836. [2024-11-19 21:47:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 659 states have (on average 1.6206373292867982) internal successors, (1068), 682 states have internal predecessors, (1068), 134 states have call successors, (134), 39 states have call predecessors, (134), 42 states have return successors, (139), 128 states have call predecessors, (139), 129 states have call successors, (139) [2024-11-19 21:47:50,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1341 transitions. [2024-11-19 21:47:50,369 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1341 transitions. Word has length 77 [2024-11-19 21:47:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:50,369 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1341 transitions. [2024-11-19 21:47:50,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 6 states have internal predecessors, (60), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-19 21:47:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1341 transitions. [2024-11-19 21:47:50,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 21:47:50,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:50,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:50,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:47:50,371 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:50,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:50,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1213407148, now seen corresponding path program 1 times [2024-11-19 21:47:50,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:50,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382020925] [2024-11-19 21:47:50,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:50,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:47:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:50,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:50,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:50,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:50,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382020925] [2024-11-19 21:47:50,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382020925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:50,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:50,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:50,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928100496] [2024-11-19 21:47:50,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:50,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:50,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:50,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:50,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:50,778 INFO L87 Difference]: Start difference. First operand 836 states and 1341 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:53,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:53,647 INFO L93 Difference]: Finished difference Result 1821 states and 2971 transitions. [2024-11-19 21:47:53,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:47:53,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 21:47:53,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:53,652 INFO L225 Difference]: With dead ends: 1821 [2024-11-19 21:47:53,652 INFO L226 Difference]: Without dead ends: 1047 [2024-11-19 21:47:53,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:53,654 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 1224 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 2528 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1306 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:53,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1306 Valid, 1111 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2528 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 21:47:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1047 states. [2024-11-19 21:47:53,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1047 to 836. [2024-11-19 21:47:53,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 659 states have (on average 1.6130500758725341) internal successors, (1063), 682 states have internal predecessors, (1063), 134 states have call successors, (134), 39 states have call predecessors, (134), 42 states have return successors, (139), 128 states have call predecessors, (139), 129 states have call successors, (139) [2024-11-19 21:47:53,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1336 transitions. [2024-11-19 21:47:53,786 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1336 transitions. Word has length 78 [2024-11-19 21:47:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:53,787 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1336 transitions. [2024-11-19 21:47:53,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:53,787 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1336 transitions. [2024-11-19 21:47:53,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-19 21:47:53,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:53,788 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:53,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:47:53,789 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:53,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:53,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1512506551, now seen corresponding path program 1 times [2024-11-19 21:47:53,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:53,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435326641] [2024-11-19 21:47:53,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:53,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:53,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:53,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:53,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:54,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:47:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:54,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:54,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:54,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:54,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:54,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:54,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435326641] [2024-11-19 21:47:54,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435326641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:54,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:54,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:54,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117965237] [2024-11-19 21:47:54,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:54,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:54,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:54,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:54,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:54,169 INFO L87 Difference]: Start difference. First operand 836 states and 1336 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:57,227 INFO L93 Difference]: Finished difference Result 1792 states and 2923 transitions. [2024-11-19 21:47:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:47:57,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 78 [2024-11-19 21:47:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:57,232 INFO L225 Difference]: With dead ends: 1792 [2024-11-19 21:47:57,232 INFO L226 Difference]: Without dead ends: 1035 [2024-11-19 21:47:57,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:47:57,234 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 733 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 2643 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 2760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:57,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 1088 Invalid, 2760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2643 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 21:47:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-11-19 21:47:57,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 836. [2024-11-19 21:47:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 836 states, 659 states have (on average 1.6115326251896813) internal successors, (1062), 682 states have internal predecessors, (1062), 134 states have call successors, (134), 39 states have call predecessors, (134), 42 states have return successors, (139), 128 states have call predecessors, (139), 129 states have call successors, (139) [2024-11-19 21:47:57,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 836 states to 836 states and 1335 transitions. [2024-11-19 21:47:57,365 INFO L78 Accepts]: Start accepts. Automaton has 836 states and 1335 transitions. Word has length 78 [2024-11-19 21:47:57,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:57,367 INFO L471 AbstractCegarLoop]: Abstraction has 836 states and 1335 transitions. [2024-11-19 21:47:57,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:47:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 836 states and 1335 transitions. [2024-11-19 21:47:57,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 21:47:57,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:57,369 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:57,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:47:57,369 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:57,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:57,369 INFO L85 PathProgramCache]: Analyzing trace with hash -534947849, now seen corresponding path program 1 times [2024-11-19 21:47:57,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:57,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809998625] [2024-11-19 21:47:57,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:57,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:47:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:47:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809998625] [2024-11-19 21:47:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809998625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:57,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:57,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:47:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374642154] [2024-11-19 21:47:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:57,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:47:57,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:57,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:47:57,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:47:57,740 INFO L87 Difference]: Start difference. First operand 836 states and 1335 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:48:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:00,716 INFO L93 Difference]: Finished difference Result 1845 states and 2988 transitions. [2024-11-19 21:48:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 21:48:00,717 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2024-11-19 21:48:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:00,722 INFO L225 Difference]: With dead ends: 1845 [2024-11-19 21:48:00,722 INFO L226 Difference]: Without dead ends: 982 [2024-11-19 21:48:00,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:48:00,725 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 1156 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 2547 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1238 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:48:00,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1238 Valid, 1091 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2547 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 21:48:00,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2024-11-19 21:48:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 794. [2024-11-19 21:48:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 620 states have (on average 1.6274193548387097) internal successors, (1009), 641 states have internal predecessors, (1009), 133 states have call successors, (133), 39 states have call predecessors, (133), 40 states have return successors, (136), 127 states have call predecessors, (136), 128 states have call successors, (136) [2024-11-19 21:48:00,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1278 transitions. [2024-11-19 21:48:00,855 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1278 transitions. Word has length 79 [2024-11-19 21:48:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:00,855 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1278 transitions. [2024-11-19 21:48:00,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 21:48:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1278 transitions. [2024-11-19 21:48:00,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 21:48:00,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:00,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:48:00,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:48:00,858 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:00,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1722677858, now seen corresponding path program 1 times [2024-11-19 21:48:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:00,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670912702] [2024-11-19 21:48:00,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:00,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:00,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:01,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:48:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:01,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:01,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:01,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:48:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:01,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:01,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:01,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:48:01,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:01,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 21:48:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:48:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:01,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670912702] [2024-11-19 21:48:01,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670912702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:01,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:48:01,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 21:48:01,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035029615] [2024-11-19 21:48:01,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:01,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:48:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:01,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:48:01,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:48:01,462 INFO L87 Difference]: Start difference. First operand 794 states and 1278 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 21:48:07,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:07,025 INFO L93 Difference]: Finished difference Result 2832 states and 4715 transitions. [2024-11-19 21:48:07,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:48:07,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 81 [2024-11-19 21:48:07,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:07,034 INFO L225 Difference]: With dead ends: 2832 [2024-11-19 21:48:07,034 INFO L226 Difference]: Without dead ends: 2084 [2024-11-19 21:48:07,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:48:07,036 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 3486 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 3074 mSolverCounterSat, 842 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3571 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 3916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 842 IncrementalHoareTripleChecker+Valid, 3074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:48:07,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3571 Valid, 1422 Invalid, 3916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [842 Valid, 3074 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-19 21:48:07,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2084 states. [2024-11-19 21:48:07,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2084 to 1551. [2024-11-19 21:48:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1551 states, 1219 states have (on average 1.638228055783429) internal successors, (1997), 1249 states have internal predecessors, (1997), 253 states have call successors, (253), 72 states have call predecessors, (253), 78 states have return successors, (273), 242 states have call predecessors, (273), 248 states have call successors, (273) [2024-11-19 21:48:07,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1551 states to 1551 states and 2523 transitions. [2024-11-19 21:48:07,321 INFO L78 Accepts]: Start accepts. Automaton has 1551 states and 2523 transitions. Word has length 81 [2024-11-19 21:48:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:07,322 INFO L471 AbstractCegarLoop]: Abstraction has 1551 states and 2523 transitions. [2024-11-19 21:48:07,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 6 states have internal predecessors, (64), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-19 21:48:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1551 states and 2523 transitions. [2024-11-19 21:48:07,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 21:48:07,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:07,325 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:48:07,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:48:07,325 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:07,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:07,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1774520580, now seen corresponding path program 1 times [2024-11-19 21:48:07,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:07,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436168955] [2024-11-19 21:48:07,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:07,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:07,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:48:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:07,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:07,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:07,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:48:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:48:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:48:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:48:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 21:48:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 21:48:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 21:48:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:48:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:48:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:48:08,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:08,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436168955] [2024-11-19 21:48:08,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436168955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:08,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:48:08,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:48:08,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442623787] [2024-11-19 21:48:08,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:08,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:48:08,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:08,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:48:08,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:48:08,392 INFO L87 Difference]: Start difference. First operand 1551 states and 2523 transitions. Second operand has 12 states, 12 states have (on average 7.5) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 21:48:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:13,254 INFO L93 Difference]: Finished difference Result 3611 states and 6006 transitions. [2024-11-19 21:48:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:48:13,254 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 121 [2024-11-19 21:48:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:13,262 INFO L225 Difference]: With dead ends: 3611 [2024-11-19 21:48:13,262 INFO L226 Difference]: Without dead ends: 2106 [2024-11-19 21:48:13,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2024-11-19 21:48:13,266 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 3055 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 3593 mSolverCounterSat, 955 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3055 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 4548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 955 IncrementalHoareTripleChecker+Valid, 3593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:48:13,266 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3055 Valid, 1769 Invalid, 4548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [955 Valid, 3593 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 21:48:13,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2024-11-19 21:48:13,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1561. [2024-11-19 21:48:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1227 states have (on average 1.6340668296658516) internal successors, (2005), 1257 states have internal predecessors, (2005), 253 states have call successors, (253), 72 states have call predecessors, (253), 80 states have return successors, (275), 242 states have call predecessors, (275), 248 states have call successors, (275) [2024-11-19 21:48:13,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2533 transitions. [2024-11-19 21:48:13,555 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2533 transitions. Word has length 121 [2024-11-19 21:48:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:13,556 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2533 transitions. [2024-11-19 21:48:13,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.5) internal successors, (90), 8 states have internal predecessors, (90), 4 states have call successors, (15), 6 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-19 21:48:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2533 transitions. [2024-11-19 21:48:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 21:48:13,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:13,563 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:48:13,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:48:13,563 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:13,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1054983864, now seen corresponding path program 1 times [2024-11-19 21:48:13,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:13,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955527034] [2024-11-19 21:48:13,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:13,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:13,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:48:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:13,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:13,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:48:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:48:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:48:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:48:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:48:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 21:48:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:48:14,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-19 21:48:14,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-19 21:48:14,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:48:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-19 21:48:14,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:14,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955527034] [2024-11-19 21:48:14,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955527034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:14,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:48:14,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 21:48:14,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104758242] [2024-11-19 21:48:14,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:14,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 21:48:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:14,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 21:48:14,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:48:14,428 INFO L87 Difference]: Start difference. First operand 1561 states and 2533 transitions. Second operand has 13 states, 13 states have (on average 6.846153846153846) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (16), 6 states have call predecessors, (16), 4 states have return successors, (15), 5 states have call predecessors, (15), 3 states have call successors, (15)