./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_spec2_product23.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_spec2_product23.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 3c1ff6fd56cd2377d464f2b10cb9a0da8b8728fdfad0102577329687d925f1d9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:42:33,190 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:42:33,253 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:42:33,258 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:42:33,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:42:33,291 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:42:33,291 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:42:33,292 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:42:33,292 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:42:33,294 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:42:33,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:42:33,295 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:42:33,295 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:42:33,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:42:33,296 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:42:33,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:42:33,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:42:33,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:42:33,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:42:33,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:42:33,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:42:33,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:42:33,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:42:33,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:42:33,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:42:33,302 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:42:33,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:42:33,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:42:33,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:42:33,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:42:33,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:42:33,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:42:33,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:42:33,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:42:33,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:42:33,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:42:33,304 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:42:33,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:42:33,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:42:33,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:42:33,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:42:33,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:42:33,307 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 -> 3c1ff6fd56cd2377d464f2b10cb9a0da8b8728fdfad0102577329687d925f1d9 [2024-11-19 21:42:33,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:42:33,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:42:33,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:42:33,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:42:33,614 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:42:33,615 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product23.cil.c [2024-11-19 21:42:35,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:42:35,343 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:42:35,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product23.cil.c [2024-11-19 21:42:35,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02acd9f5/cc31b4af00204058bdda4632d7687290/FLAG08b976290 [2024-11-19 21:42:35,629 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a02acd9f5/cc31b4af00204058bdda4632d7687290 [2024-11-19 21:42:35,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:42:35,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:42:35,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:42:35,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:42:35,638 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:42:35,639 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:35" (1/1) ... [2024-11-19 21:42:35,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee5ada1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:35, skipping insertion in model container [2024-11-19 21:42:35,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:42:35" (1/1) ... [2024-11-19 21:42:35,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:42:36,131 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_spec2_product23.cil.c[35995,36008] [2024-11-19 21:42:36,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:42:36,285 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:42:36,296 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [48] [2024-11-19 21:42:36,297 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [235] [2024-11-19 21:42:36,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [273] [2024-11-19 21:42:36,298 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [941] [2024-11-19 21:42:36,299 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1307] [2024-11-19 21:42:36,299 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1665] [2024-11-19 21:42:36,299 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1674] [2024-11-19 21:42:36,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1766] [2024-11-19 21:42:36,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1778] [2024-11-19 21:42:36,300 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1898] [2024-11-19 21:42:36,355 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_spec2_product23.cil.c[35995,36008] [2024-11-19 21:42:36,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:42:36,442 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:42:36,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36 WrapperNode [2024-11-19 21:42:36,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:42:36,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:42:36,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:42:36,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:42:36,451 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:42:36" (1/1) ... [2024-11-19 21:42:36,476 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:42:36" (1/1) ... [2024-11-19 21:42:36,525 INFO L138 Inliner]: procedures = 96, calls = 347, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 921 [2024-11-19 21:42:36,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:42:36,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:42:36,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:42:36,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:42:36,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36" (1/1) ... [2024-11-19 21:42:36,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36" (1/1) ... [2024-11-19 21:42:36,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36" (1/1) ... [2024-11-19 21:42:36,574 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:42:36,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36" (1/1) ... [2024-11-19 21:42:36,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36" (1/1) ... [2024-11-19 21:42:36,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36" (1/1) ... [2024-11-19 21:42:36,617 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36" (1/1) ... [2024-11-19 21:42:36,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36" (1/1) ... [2024-11-19 21:42:36,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36" (1/1) ... [2024-11-19 21:42:36,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:42:36,662 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:42:36,662 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:42:36,662 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:42:36,663 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36" (1/1) ... [2024-11-19 21:42:36,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:42:36,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:42:36,708 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:42:36,715 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:42:36,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:42:36,762 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-19 21:42:36,762 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-11-19 21:42:36,762 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-19 21:42:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-19 21:42:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-19 21:42:36,763 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-19 21:42:36,763 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-19 21:42:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-19 21:42:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-11-19 21:42:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-11-19 21:42:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-19 21:42:36,764 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-19 21:42:36,764 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-19 21:42:36,765 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-19 21:42:36,765 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 21:42:36,766 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 21:42:36,766 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 21:42:36,766 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 21:42:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-11-19 21:42:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-11-19 21:42:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-19 21:42:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-19 21:42:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-19 21:42:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-19 21:42:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-19 21:42:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-19 21:42:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-19 21:42:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-19 21:42:36,767 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-19 21:42:36,767 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-19 21:42:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-19 21:42:36,768 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-19 21:42:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-19 21:42:36,768 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-19 21:42:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-19 21:42:36,768 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-19 21:42:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-19 21:42:36,768 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-19 21:42:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-19 21:42:36,768 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-19 21:42:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:42:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:42:36,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:42:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:42:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 21:42:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 21:42:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 21:42:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 21:42:36,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 21:42:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 21:42:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 21:42:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 21:42:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 21:42:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 21:42:36,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-19 21:42:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-19 21:42:36,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-19 21:42:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-19 21:42:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-19 21:42:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-19 21:42:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-11-19 21:42:36,775 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-11-19 21:42:36,775 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-19 21:42:36,776 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-19 21:42:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-19 21:42:36,776 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-19 21:42:36,776 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-19 21:42:36,777 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-19 21:42:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-11-19 21:42:36,777 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-11-19 21:42:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:42:36,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:42:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-19 21:42:36,778 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-19 21:42:36,953 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:42:36,955 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:42:38,272 INFO L? ?]: Removed 471 outVars from TransFormulas that were not future-live. [2024-11-19 21:42:38,273 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:42:38,309 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:42:38,309 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:42:38,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:42:38 BoogieIcfgContainer [2024-11-19 21:42:38,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:42:38,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:42:38,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:42:38,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:42:38,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:42:35" (1/3) ... [2024-11-19 21:42:38,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd45294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:42:38, skipping insertion in model container [2024-11-19 21:42:38,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:42:36" (2/3) ... [2024-11-19 21:42:38,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd45294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:42:38, skipping insertion in model container [2024-11-19 21:42:38,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:42:38" (3/3) ... [2024-11-19 21:42:38,320 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product23.cil.c [2024-11-19 21:42:38,337 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:42:38,338 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:42:38,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:42:38,431 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;@4dc69785, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:42:38,433 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:42:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand has 587 states, 457 states have (on average 1.6783369803063457) internal successors, (767), 478 states have internal predecessors, (767), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-19 21:42:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 21:42:38,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:38,476 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:38,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:38,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:38,482 INFO L85 PathProgramCache]: Analyzing trace with hash -253611575, now seen corresponding path program 1 times [2024-11-19 21:42:38,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:38,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601850861] [2024-11-19 21:42:38,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:38,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:38,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:42:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 21:42:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:42:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:42:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:39,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:42:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:42:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:42:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:42:39,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601850861] [2024-11-19 21:42:39,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601850861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:39,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:39,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:42:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430033499] [2024-11-19 21:42:39,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:39,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:42:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:39,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:42:39,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:42:39,985 INFO L87 Difference]: Start difference. First operand has 587 states, 457 states have (on average 1.6783369803063457) internal successors, (767), 478 states have internal predecessors, (767), 102 states have call successors, (102), 26 states have call predecessors, (102), 26 states have return successors, (102), 96 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:42:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:45,851 INFO L93 Difference]: Finished difference Result 1415 states and 2379 transitions. [2024-11-19 21:42:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:42:45,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-11-19 21:42:45,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:45,884 INFO L225 Difference]: With dead ends: 1415 [2024-11-19 21:42:45,884 INFO L226 Difference]: Without dead ends: 840 [2024-11-19 21:42:45,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:42:45,903 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1463 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 2996 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 1835 SdHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:45,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 1835 Invalid, 3368 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [372 Valid, 2996 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-19 21:42:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-19 21:42:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 579. [2024-11-19 21:42:46,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 451 states have (on average 1.6740576496674058) internal successors, (755), 470 states have internal predecessors, (755), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:42:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 954 transitions. [2024-11-19 21:42:46,190 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 954 transitions. Word has length 104 [2024-11-19 21:42:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:46,192 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 954 transitions. [2024-11-19 21:42:46,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:42:46,193 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 954 transitions. [2024-11-19 21:42:46,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 21:42:46,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:46,202 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:46,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 21:42:46,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:46,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:46,203 INFO L85 PathProgramCache]: Analyzing trace with hash -865857752, now seen corresponding path program 1 times [2024-11-19 21:42:46,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:46,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454652373] [2024-11-19 21:42:46,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:46,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-19 21:42:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:46,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:42:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:42:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:42:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:42:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:42:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:42:46,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:46,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454652373] [2024-11-19 21:42:46,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454652373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:46,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:46,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:42:46,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509222325] [2024-11-19 21:42:46,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:46,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:42:46,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:46,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:42:46,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:42:46,929 INFO L87 Difference]: Start difference. First operand 579 states and 954 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:42:51,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:51,843 INFO L93 Difference]: Finished difference Result 1401 states and 2341 transitions. [2024-11-19 21:42:51,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:42:51,844 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2024-11-19 21:42:51,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:51,854 INFO L225 Difference]: With dead ends: 1401 [2024-11-19 21:42:51,855 INFO L226 Difference]: Without dead ends: 840 [2024-11-19 21:42:51,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:42:51,859 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 999 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 3082 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1877 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 3082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:51,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 1877 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 3082 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-19 21:42:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-19 21:42:52,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 579. [2024-11-19 21:42:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 451 states have (on average 1.671840354767184) internal successors, (754), 470 states have internal predecessors, (754), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:42:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 953 transitions. [2024-11-19 21:42:52,009 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 953 transitions. Word has length 107 [2024-11-19 21:42:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:52,009 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 953 transitions. [2024-11-19 21:42:52,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:42:52,010 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 953 transitions. [2024-11-19 21:42:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 21:42:52,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:52,014 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:52,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:42:52,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:52,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:52,015 INFO L85 PathProgramCache]: Analyzing trace with hash 569294233, now seen corresponding path program 1 times [2024-11-19 21:42:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:52,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796928739] [2024-11-19 21:42:52,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:52,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:42:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 21:42:52,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:42:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:42:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:52,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:42:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:42:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:42:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:42:52,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:52,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796928739] [2024-11-19 21:42:52,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796928739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:52,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:52,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:42:52,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095797183] [2024-11-19 21:42:52,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:52,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:42:52,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:52,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:42:52,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:42:52,647 INFO L87 Difference]: Start difference. First operand 579 states and 953 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:42:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:42:57,419 INFO L93 Difference]: Finished difference Result 1401 states and 2340 transitions. [2024-11-19 21:42:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:42:57,419 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2024-11-19 21:42:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:42:57,426 INFO L225 Difference]: With dead ends: 1401 [2024-11-19 21:42:57,426 INFO L226 Difference]: Without dead ends: 840 [2024-11-19 21:42:57,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:42:57,433 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 1455 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 2999 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1542 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 3368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:42:57,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1542 Valid, 1805 Invalid, 3368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2999 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-19 21:42:57,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-19 21:42:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 579. [2024-11-19 21:42:57,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 451 states have (on average 1.6696230598669624) internal successors, (753), 470 states have internal predecessors, (753), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:42:57,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 952 transitions. [2024-11-19 21:42:57,571 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 952 transitions. Word has length 108 [2024-11-19 21:42:57,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:42:57,572 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 952 transitions. [2024-11-19 21:42:57,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:42:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 952 transitions. [2024-11-19 21:42:57,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 21:42:57,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:42:57,576 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:57,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 21:42:57,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:42:57,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:42:57,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1128617020, now seen corresponding path program 1 times [2024-11-19 21:42:57,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:42:57,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865885942] [2024-11-19 21:42:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:42:57,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:42:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:57,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:42:57,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:57,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:57,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:42:57,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:42:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:58,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:42:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:42:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:42:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:42:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:42:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:42:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:42:58,181 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:42:58,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:42:58,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865885942] [2024-11-19 21:42:58,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865885942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:42:58,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:42:58,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:42:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459479276] [2024-11-19 21:42:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:42:58,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:42:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:42:58,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:42:58,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:42:58,184 INFO L87 Difference]: Start difference. First operand 579 states and 952 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:02,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:02,660 INFO L93 Difference]: Finished difference Result 1401 states and 2339 transitions. [2024-11-19 21:43:02,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:43:02,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 109 [2024-11-19 21:43:02,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:02,666 INFO L225 Difference]: With dead ends: 1401 [2024-11-19 21:43:02,666 INFO L226 Difference]: Without dead ends: 840 [2024-11-19 21:43:02,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:43:02,670 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 1454 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 2984 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:02,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1541 Valid, 1805 Invalid, 3355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 2984 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 21:43:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-19 21:43:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 579. [2024-11-19 21:43:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 451 states have (on average 1.6674057649667406) internal successors, (752), 470 states have internal predecessors, (752), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:43:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 951 transitions. [2024-11-19 21:43:02,778 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 951 transitions. Word has length 109 [2024-11-19 21:43:02,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:02,779 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 951 transitions. [2024-11-19 21:43:02,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:02,779 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 951 transitions. [2024-11-19 21:43:02,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 21:43:02,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:02,782 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:02,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 21:43:02,783 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:02,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:02,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1167240843, now seen corresponding path program 1 times [2024-11-19 21:43:02,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:02,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134573891] [2024-11-19 21:43:02,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:02,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:02,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 21:43:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:43:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:03,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:03,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:03,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134573891] [2024-11-19 21:43:03,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134573891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:03,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:03,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:43:03,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074524478] [2024-11-19 21:43:03,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:03,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:43:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:03,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:43:03,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:43:03,413 INFO L87 Difference]: Start difference. First operand 579 states and 951 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:07,465 INFO L93 Difference]: Finished difference Result 1401 states and 2338 transitions. [2024-11-19 21:43:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:43:07,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-11-19 21:43:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:07,471 INFO L225 Difference]: With dead ends: 1401 [2024-11-19 21:43:07,471 INFO L226 Difference]: Without dead ends: 840 [2024-11-19 21:43:07,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:43:07,474 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1912 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 2820 mSolverCounterSat, 525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1999 SdHoareTripleChecker+Valid, 1753 SdHoareTripleChecker+Invalid, 3345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 525 IncrementalHoareTripleChecker+Valid, 2820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:07,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1999 Valid, 1753 Invalid, 3345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [525 Valid, 2820 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 21:43:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2024-11-19 21:43:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 579. [2024-11-19 21:43:07,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 451 states have (on average 1.665188470066519) internal successors, (751), 470 states have internal predecessors, (751), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:43:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 950 transitions. [2024-11-19 21:43:07,596 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 950 transitions. Word has length 110 [2024-11-19 21:43:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:07,596 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 950 transitions. [2024-11-19 21:43:07,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:07,597 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 950 transitions. [2024-11-19 21:43:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 21:43:07,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:07,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:07,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 21:43:07,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:07,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:07,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1307561888, now seen corresponding path program 1 times [2024-11-19 21:43:07,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:07,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260967908] [2024-11-19 21:43:07,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:07,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:07,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:07,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:07,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:43:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:08,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:08,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260967908] [2024-11-19 21:43:08,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260967908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:08,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:08,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:43:08,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018695369] [2024-11-19 21:43:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:08,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:43:08,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:08,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:43:08,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:43:08,279 INFO L87 Difference]: Start difference. First operand 579 states and 950 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:12,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:12,604 INFO L93 Difference]: Finished difference Result 1373 states and 2279 transitions. [2024-11-19 21:43:12,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:43:12,604 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2024-11-19 21:43:12,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:12,611 INFO L225 Difference]: With dead ends: 1373 [2024-11-19 21:43:12,611 INFO L226 Difference]: Without dead ends: 852 [2024-11-19 21:43:12,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:43:12,615 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 1996 mSDsluCounter, 2179 mSDsCounter, 0 mSdLazyCounter, 4479 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2083 SdHoareTripleChecker+Valid, 2654 SdHoareTripleChecker+Invalid, 5016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 4479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:12,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2083 Valid, 2654 Invalid, 5016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 4479 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-19 21:43:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-11-19 21:43:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 579. [2024-11-19 21:43:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 451 states have (on average 1.6541019955654102) internal successors, (746), 470 states have internal predecessors, (746), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:43:12,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 945 transitions. [2024-11-19 21:43:12,779 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 945 transitions. Word has length 111 [2024-11-19 21:43:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:12,780 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 945 transitions. [2024-11-19 21:43:12,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:12,780 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 945 transitions. [2024-11-19 21:43:12,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 21:43:12,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:12,785 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:12,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:43:12,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:12,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:12,786 INFO L85 PathProgramCache]: Analyzing trace with hash -761630507, now seen corresponding path program 1 times [2024-11-19 21:43:12,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:12,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931375027] [2024-11-19 21:43:12,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:12,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:43:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:13,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:13,500 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:13,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:13,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931375027] [2024-11-19 21:43:13,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931375027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:13,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:13,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:43:13,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961048493] [2024-11-19 21:43:13,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:13,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:43:13,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:13,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:43:13,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:43:13,505 INFO L87 Difference]: Start difference. First operand 579 states and 945 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:18,360 INFO L93 Difference]: Finished difference Result 1373 states and 2274 transitions. [2024-11-19 21:43:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:43:18,361 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 112 [2024-11-19 21:43:18,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:18,366 INFO L225 Difference]: With dead ends: 1373 [2024-11-19 21:43:18,366 INFO L226 Difference]: Without dead ends: 852 [2024-11-19 21:43:18,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:43:18,369 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 1061 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 4669 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1148 SdHoareTripleChecker+Valid, 2779 SdHoareTripleChecker+Invalid, 4880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 4669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:18,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1148 Valid, 2779 Invalid, 4880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 4669 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-19 21:43:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-11-19 21:43:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 579. [2024-11-19 21:43:18,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 451 states have (on average 1.6430155210643016) internal successors, (741), 470 states have internal predecessors, (741), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:43:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 940 transitions. [2024-11-19 21:43:18,494 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 940 transitions. Word has length 112 [2024-11-19 21:43:18,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:18,497 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 940 transitions. [2024-11-19 21:43:18,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:18,497 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 940 transitions. [2024-11-19 21:43:18,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 21:43:18,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:18,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:18,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:43:18,502 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:18,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:18,502 INFO L85 PathProgramCache]: Analyzing trace with hash -335833787, now seen corresponding path program 1 times [2024-11-19 21:43:18,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:18,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045616887] [2024-11-19 21:43:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:18,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:18,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:18,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:18,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:18,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:43:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:19,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:19,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:19,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045616887] [2024-11-19 21:43:19,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045616887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:19,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:19,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:43:19,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002433404] [2024-11-19 21:43:19,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:19,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:43:19,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:19,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:43:19,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:43:19,176 INFO L87 Difference]: Start difference. First operand 579 states and 940 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:23,906 INFO L93 Difference]: Finished difference Result 1373 states and 2269 transitions. [2024-11-19 21:43:23,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:43:23,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2024-11-19 21:43:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:23,912 INFO L225 Difference]: With dead ends: 1373 [2024-11-19 21:43:23,912 INFO L226 Difference]: Without dead ends: 852 [2024-11-19 21:43:23,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:43:23,915 INFO L432 NwaCegarLoop]: 470 mSDtfsCounter, 1060 mSDsluCounter, 2292 mSDsCounter, 0 mSdLazyCounter, 4591 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 2762 SdHoareTripleChecker+Invalid, 4808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 4591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:23,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 2762 Invalid, 4808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 4591 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-19 21:43:23,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2024-11-19 21:43:24,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 579. [2024-11-19 21:43:24,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 451 states have (on average 1.6319290465631928) internal successors, (736), 470 states have internal predecessors, (736), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:43:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 935 transitions. [2024-11-19 21:43:24,079 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 935 transitions. Word has length 113 [2024-11-19 21:43:24,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:24,080 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 935 transitions. [2024-11-19 21:43:24,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 935 transitions. [2024-11-19 21:43:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 21:43:24,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:24,084 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:24,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:43:24,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:24,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:24,085 INFO L85 PathProgramCache]: Analyzing trace with hash 934269499, now seen corresponding path program 1 times [2024-11-19 21:43:24,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:24,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258267956] [2024-11-19 21:43:24,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:24,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:24,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:24,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:43:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:24,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:24,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:24,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258267956] [2024-11-19 21:43:24,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258267956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:24,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:24,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:43:24,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026342960] [2024-11-19 21:43:24,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:24,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:43:24,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:24,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:43:24,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:43:24,728 INFO L87 Difference]: Start difference. First operand 579 states and 935 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:28,951 INFO L93 Difference]: Finished difference Result 1359 states and 2242 transitions. [2024-11-19 21:43:28,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:43:28,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-11-19 21:43:28,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:28,957 INFO L225 Difference]: With dead ends: 1359 [2024-11-19 21:43:28,957 INFO L226 Difference]: Without dead ends: 844 [2024-11-19 21:43:28,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:43:28,960 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 1497 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 2737 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 3112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:28,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 1785 Invalid, 3112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2737 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 21:43:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-19 21:43:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 581. [2024-11-19 21:43:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 453 states have (on average 1.6291390728476822) internal successors, (738), 472 states have internal predecessors, (738), 102 states have call successors, (102), 26 states have call predecessors, (102), 25 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2024-11-19 21:43:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 937 transitions. [2024-11-19 21:43:29,093 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 937 transitions. Word has length 114 [2024-11-19 21:43:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:29,093 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 937 transitions. [2024-11-19 21:43:29,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 937 transitions. [2024-11-19 21:43:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 21:43:29,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:29,097 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:29,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:43:29,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:29,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash 660755738, now seen corresponding path program 1 times [2024-11-19 21:43:29,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:29,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177695376] [2024-11-19 21:43:29,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:29,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:29,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:43:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:29,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:29,801 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:29,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:29,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177695376] [2024-11-19 21:43:29,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177695376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:29,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:29,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:43:29,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693522250] [2024-11-19 21:43:29,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:29,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:43:29,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:29,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:43:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:43:29,804 INFO L87 Difference]: Start difference. First operand 581 states and 937 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:43:36,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:36,093 INFO L93 Difference]: Finished difference Result 1378 states and 2271 transitions. [2024-11-19 21:43:36,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 21:43:36,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2024-11-19 21:43:36,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:36,100 INFO L225 Difference]: With dead ends: 1378 [2024-11-19 21:43:36,100 INFO L226 Difference]: Without dead ends: 866 [2024-11-19 21:43:36,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:43:36,104 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 1990 mSDsluCounter, 3616 mSDsCounter, 0 mSdLazyCounter, 6904 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2078 SdHoareTripleChecker+Valid, 4100 SdHoareTripleChecker+Invalid, 7435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 6904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:36,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2078 Valid, 4100 Invalid, 7435 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [531 Valid, 6904 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-19 21:43:36,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2024-11-19 21:43:36,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 592. [2024-11-19 21:43:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 461 states have (on average 1.6268980477223427) internal successors, (750), 482 states have internal predecessors, (750), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:43:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 953 transitions. [2024-11-19 21:43:36,242 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 953 transitions. Word has length 114 [2024-11-19 21:43:36,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:36,242 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 953 transitions. [2024-11-19 21:43:36,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:43:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 953 transitions. [2024-11-19 21:43:36,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 21:43:36,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:36,246 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:36,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 21:43:36,247 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:36,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:36,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1461291291, now seen corresponding path program 1 times [2024-11-19 21:43:36,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:36,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046954356] [2024-11-19 21:43:36,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:36,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:36,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:43:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:36,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:36,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:36,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046954356] [2024-11-19 21:43:36,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046954356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:36,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:36,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:43:36,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199686247] [2024-11-19 21:43:36,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:36,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:43:36,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:36,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:43:36,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:43:36,810 INFO L87 Difference]: Start difference. First operand 592 states and 953 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:40,705 INFO L93 Difference]: Finished difference Result 1404 states and 2311 transitions. [2024-11-19 21:43:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:43:40,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-11-19 21:43:40,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:40,712 INFO L225 Difference]: With dead ends: 1404 [2024-11-19 21:43:40,712 INFO L226 Difference]: Without dead ends: 874 [2024-11-19 21:43:40,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:43:40,715 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 1524 mSDsluCounter, 1319 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:40,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 1801 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 21:43:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2024-11-19 21:43:40,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 592. [2024-11-19 21:43:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 461 states have (on average 1.616052060737527) internal successors, (745), 482 states have internal predecessors, (745), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:43:40,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 948 transitions. [2024-11-19 21:43:40,867 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 948 transitions. Word has length 114 [2024-11-19 21:43:40,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:40,867 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 948 transitions. [2024-11-19 21:43:40,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:40,868 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 948 transitions. [2024-11-19 21:43:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 21:43:40,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:40,871 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:40,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:43:40,872 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:40,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:40,872 INFO L85 PathProgramCache]: Analyzing trace with hash 70636455, now seen corresponding path program 1 times [2024-11-19 21:43:40,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:40,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194042579] [2024-11-19 21:43:40,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:40,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:43:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:41,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:41,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:41,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194042579] [2024-11-19 21:43:41,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194042579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:41,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:41,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 21:43:41,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653527877] [2024-11-19 21:43:41,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:41,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:43:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:43:41,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:43:41,494 INFO L87 Difference]: Start difference. First operand 592 states and 948 transitions. Second operand has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:43:46,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:46,912 INFO L93 Difference]: Finished difference Result 1390 states and 2279 transitions. [2024-11-19 21:43:46,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:43:46,913 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2024-11-19 21:43:46,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:46,918 INFO L225 Difference]: With dead ends: 1390 [2024-11-19 21:43:46,918 INFO L226 Difference]: Without dead ends: 872 [2024-11-19 21:43:46,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-19 21:43:46,921 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 1499 mSDsluCounter, 2709 mSDsCounter, 0 mSdLazyCounter, 5119 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 3184 SdHoareTripleChecker+Invalid, 5500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 5119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:46,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 3184 Invalid, 5500 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [381 Valid, 5119 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-19 21:43:46,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-19 21:43:47,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 595. [2024-11-19 21:43:47,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 464 states have (on average 1.6099137931034482) internal successors, (747), 485 states have internal predecessors, (747), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:43:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 950 transitions. [2024-11-19 21:43:47,065 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 950 transitions. Word has length 115 [2024-11-19 21:43:47,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:47,066 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 950 transitions. [2024-11-19 21:43:47,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.444444444444445) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:43:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 950 transitions. [2024-11-19 21:43:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 21:43:47,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:47,069 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:47,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:43:47,070 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:47,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:47,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1218851401, now seen corresponding path program 1 times [2024-11-19 21:43:47,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:47,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740128027] [2024-11-19 21:43:47,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:47,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:43:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:47,612 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:47,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:47,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740128027] [2024-11-19 21:43:47,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740128027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:47,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:47,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:43:47,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647603322] [2024-11-19 21:43:47,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:47,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:43:47,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:47,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:43:47,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:43:47,614 INFO L87 Difference]: Start difference. First operand 595 states and 950 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:51,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:43:51,644 INFO L93 Difference]: Finished difference Result 1413 states and 2311 transitions. [2024-11-19 21:43:51,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:43:51,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-11-19 21:43:51,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:43:51,649 INFO L225 Difference]: With dead ends: 1413 [2024-11-19 21:43:51,649 INFO L226 Difference]: Without dead ends: 880 [2024-11-19 21:43:51,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:43:51,651 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 1047 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 2921 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 3133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 2921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:43:51,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1869 Invalid, 3133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 2921 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-19 21:43:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-19 21:43:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 595. [2024-11-19 21:43:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 464 states have (on average 1.5991379310344827) internal successors, (742), 485 states have internal predecessors, (742), 103 states have call successors, (103), 26 states have call predecessors, (103), 27 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-11-19 21:43:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 945 transitions. [2024-11-19 21:43:51,790 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 945 transitions. Word has length 115 [2024-11-19 21:43:51,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:43:51,791 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 945 transitions. [2024-11-19 21:43:51,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:43:51,791 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 945 transitions. [2024-11-19 21:43:51,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 21:43:51,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:43:51,795 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:51,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:43:51,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:43:51,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:43:51,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1611539264, now seen corresponding path program 1 times [2024-11-19 21:43:51,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:43:51,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979348030] [2024-11-19 21:43:51,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:43:51,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:43:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:43:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:43:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:43:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-19 21:43:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:43:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:43:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:43:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:43:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:43:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:43:52,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:43:52,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979348030] [2024-11-19 21:43:52,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979348030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:43:52,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:43:52,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 21:43:52,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403102333] [2024-11-19 21:43:52,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:43:52,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:43:52,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:43:52,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:43:52,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:43:52,466 INFO L87 Difference]: Start difference. First operand 595 states and 945 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)