./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_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product31.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 a8dba55a6053d72f9111ac5cd147f9f45da0f79494b1facfa57c6480910007fb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:36:21,589 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:36:21,649 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:36:21,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:36:21,655 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:36:21,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:36:21,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:36:21,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:36:21,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:36:21,682 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:36:21,682 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:36:21,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:36:21,683 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:36:21,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:36:21,683 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:36:21,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:36:21,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:36:21,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:36:21,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:36:21,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:36:21,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:36:21,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:36:21,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:36:21,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:36:21,690 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:36:21,690 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:36:21,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:36:21,690 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:36:21,691 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:36:21,691 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:36:21,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:36:21,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:36:21,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:36:21,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:36:21,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:36:21,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:36:21,692 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:36:21,692 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:36:21,692 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:36:21,692 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:36:21,692 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:36:21,693 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:36:21,693 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-clean/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-clean/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 -> a8dba55a6053d72f9111ac5cd147f9f45da0f79494b1facfa57c6480910007fb [2024-10-11 02:36:21,894 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:36:21,915 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:36:21,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:36:21,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:36:21,919 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:36:21,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product31.cil.c [2024-10-11 02:36:23,129 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:36:23,354 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:36:23,355 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product31.cil.c [2024-10-11 02:36:23,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0202e43c4/04e88063d71e4cbab11c81a1775e468c/FLAG4018c4e10 [2024-10-11 02:36:23,687 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/0202e43c4/04e88063d71e4cbab11c81a1775e468c [2024-10-11 02:36:23,689 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:36:23,690 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:36:23,691 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:36:23,691 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:36:23,698 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:36:23,698 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:36:23" (1/1) ... [2024-10-11 02:36:23,700 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32763ce9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:23, skipping insertion in model container [2024-10-11 02:36:23,700 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:36:23" (1/1) ... [2024-10-11 02:36:23,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:36:24,119 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product31.cil.c[64450,64463] [2024-10-11 02:36:24,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:36:24,175 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:36:24,182 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-10-11 02:36:24,183 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [716] [2024-10-11 02:36:24,183 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification2_spec.i","") [837] [2024-10-11 02:36:24,184 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1024] [2024-10-11 02:36:24,184 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1121] [2024-10-11 02:36:24,185 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1476] [2024-10-11 02:36:24,185 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3091] [2024-10-11 02:36:24,185 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3126] [2024-10-11 02:36:24,185 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3135] [2024-10-11 02:36:24,186 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3501] [2024-10-11 02:36:24,248 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec2_product31.cil.c[64450,64463] [2024-10-11 02:36:24,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:36:24,287 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:36:24,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24 WrapperNode [2024-10-11 02:36:24,287 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:36:24,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:36:24,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:36:24,289 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:36:24,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,371 INFO L138 Inliner]: procedures = 97, calls = 349, calls flagged for inlining = 28, calls inlined = 25, statements flattened = 965 [2024-10-11 02:36:24,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:36:24,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:36:24,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:36:24,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:36:24,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,392 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,412 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-11 02:36:24,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,441 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,452 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:36:24,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:36:24,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:36:24,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:36:24,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (1/1) ... [2024-10-11 02:36:24,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:36:24,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:36:24,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:36:24,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:36:24,544 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:36:24,545 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:36:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:36:24,545 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:36:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:36:24,545 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:36:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-11 02:36:24,545 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-11 02:36:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:36:24,546 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:36:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:36:24,547 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:36:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:36:24,547 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:36:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-11 02:36:24,548 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-11 02:36:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-11 02:36:24,548 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-11 02:36:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:36:24,548 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:36:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:36:24,549 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:36:24,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:36:24,550 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-11 02:36:24,550 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-11 02:36:24,550 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:36:24,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:36:24,550 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-11 02:36:24,550 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-11 02:36:24,550 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:36:24,550 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:36:24,550 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:36:24,550 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:36:24,550 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-11 02:36:24,550 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-11 02:36:24,551 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:36:24,551 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:36:24,551 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:36:24,551 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:36:24,551 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:36:24,551 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:36:24,551 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:36:24,551 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:36:24,551 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:36:24,551 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:36:24,551 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:36:24,551 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:36:24,551 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:36:24,552 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:36:24,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:36:24,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:36:24,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:36:24,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:36:24,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:36:24,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:36:24,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:36:24,553 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:36:24,553 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:36:24,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:36:24,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:36:24,553 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:36:24,553 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:36:24,710 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:36:24,712 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:36:25,606 INFO L? ?]: Removed 483 outVars from TransFormulas that were not future-live. [2024-10-11 02:36:25,606 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:36:25,668 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:36:25,669 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:36:25,669 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:36:25 BoogieIcfgContainer [2024-10-11 02:36:25,669 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:36:25,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:36:25,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:36:25,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:36:25,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:36:23" (1/3) ... [2024-10-11 02:36:25,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3565f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:36:25, skipping insertion in model container [2024-10-11 02:36:25,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:36:24" (2/3) ... [2024-10-11 02:36:25,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c3565f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:36:25, skipping insertion in model container [2024-10-11 02:36:25,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:36:25" (3/3) ... [2024-10-11 02:36:25,676 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product31.cil.c [2024-10-11 02:36:25,689 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:36:25,689 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:36:25,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:36:25,760 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;@28a92259, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:36:25,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:36:25,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 574 states, 444 states have (on average 1.7139639639639639) internal successors, (761), 465 states have internal predecessors, (761), 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-10-11 02:36:25,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 02:36:25,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:25,786 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:36:25,786 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:25,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:25,790 INFO L85 PathProgramCache]: Analyzing trace with hash 623565855, now seen corresponding path program 1 times [2024-10-11 02:36:25,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:25,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755269752] [2024-10-11 02:36:25,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:25,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:36:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:36:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:36:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:36:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:36:26,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:26,809 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:36:26,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:26,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755269752] [2024-10-11 02:36:26,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755269752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:26,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:26,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:36:26,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154865802] [2024-10-11 02:36:26,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:26,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:36:26,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:36:26,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:36:26,848 INFO L87 Difference]: Start difference. First operand has 574 states, 444 states have (on average 1.7139639639639639) internal successors, (761), 465 states have internal predecessors, (761), 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 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 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-10-11 02:36:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:35,138 INFO L93 Difference]: Finished difference Result 2062 states and 3564 transitions. [2024-10-11 02:36:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 02:36:35,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 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 91 [2024-10-11 02:36:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:35,168 INFO L225 Difference]: With dead ends: 2062 [2024-10-11 02:36:35,168 INFO L226 Difference]: Without dead ends: 1494 [2024-10-11 02:36:35,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:36:35,183 INFO L432 NwaCegarLoop]: 701 mSDtfsCounter, 1848 mSDsluCounter, 2310 mSDsCounter, 0 mSdLazyCounter, 6522 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1941 SdHoareTripleChecker+Valid, 3011 SdHoareTripleChecker+Invalid, 7011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 6522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:35,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1941 Valid, 3011 Invalid, 7011 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [489 Valid, 6522 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2024-10-11 02:36:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2024-10-11 02:36:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1110. [2024-10-11 02:36:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 859 states have (on average 1.6973224679860304) internal successors, (1458), 891 states have internal predecessors, (1458), 202 states have call successors, (202), 46 states have call predecessors, (202), 48 states have return successors, (206), 196 states have call predecessors, (206), 197 states have call successors, (206) [2024-10-11 02:36:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1866 transitions. [2024-10-11 02:36:35,466 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1866 transitions. Word has length 91 [2024-10-11 02:36:35,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:35,467 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1866 transitions. [2024-10-11 02:36:35,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 5 states have internal predecessors, (55), 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-10-11 02:36:35,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1866 transitions. [2024-10-11 02:36:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:36:35,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:35,474 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:36:35,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:36:35,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:35,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:35,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1006978343, now seen corresponding path program 1 times [2024-10-11 02:36:35,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:35,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022475896] [2024-10-11 02:36:35,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:35,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:35,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:36:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:36:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:35,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:36,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:36,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:36,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:36,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:36,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:36,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:36:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:36,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:36,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:36,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:36,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:36,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:36:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:36,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:36:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:36:36,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:36,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022475896] [2024-10-11 02:36:36,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022475896] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:36,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:36,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:36:36,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649476181] [2024-10-11 02:36:36,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:36,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:36:36,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:36,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:36:36,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:36,039 INFO L87 Difference]: Start difference. First operand 1110 states and 1866 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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-10-11 02:36:40,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:40,144 INFO L93 Difference]: Finished difference Result 2566 states and 4373 transitions. [2024-10-11 02:36:40,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:36:40,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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 93 [2024-10-11 02:36:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:40,152 INFO L225 Difference]: With dead ends: 2566 [2024-10-11 02:36:40,152 INFO L226 Difference]: Without dead ends: 1468 [2024-10-11 02:36:40,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:36:40,158 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1010 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:40,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 1716 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:36:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2024-10-11 02:36:40,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1110. [2024-10-11 02:36:40,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 859 states have (on average 1.6961583236321305) internal successors, (1457), 891 states have internal predecessors, (1457), 202 states have call successors, (202), 46 states have call predecessors, (202), 48 states have return successors, (206), 196 states have call predecessors, (206), 197 states have call successors, (206) [2024-10-11 02:36:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1865 transitions. [2024-10-11 02:36:40,395 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1865 transitions. Word has length 93 [2024-10-11 02:36:40,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:40,395 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1865 transitions. [2024-10-11 02:36:40,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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-10-11 02:36:40,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1865 transitions. [2024-10-11 02:36:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:36:40,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:40,398 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:36:40,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:36:40,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:40,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:40,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1892266474, now seen corresponding path program 1 times [2024-10-11 02:36:40,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:40,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948445585] [2024-10-11 02:36:40,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:40,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:36:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:36:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:36:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:36:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:36:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:40,858 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:36:40,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:40,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948445585] [2024-10-11 02:36:40,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948445585] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:40,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:40,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:36:40,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998671222] [2024-10-11 02:36:40,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:40,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:36:40,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:40,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:36:40,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:40,861 INFO L87 Difference]: Start difference. First operand 1110 states and 1865 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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-10-11 02:36:44,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:44,540 INFO L93 Difference]: Finished difference Result 2566 states and 4372 transitions. [2024-10-11 02:36:44,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:36:44,541 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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 94 [2024-10-11 02:36:44,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:44,548 INFO L225 Difference]: With dead ends: 2566 [2024-10-11 02:36:44,548 INFO L226 Difference]: Without dead ends: 1468 [2024-10-11 02:36:44,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:36:44,553 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 1461 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 3090 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 3453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 3090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:44,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 1680 Invalid, 3453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 3090 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:36:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2024-10-11 02:36:44,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1110. [2024-10-11 02:36:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 859 states have (on average 1.6949941792782306) internal successors, (1456), 891 states have internal predecessors, (1456), 202 states have call successors, (202), 46 states have call predecessors, (202), 48 states have return successors, (206), 196 states have call predecessors, (206), 197 states have call successors, (206) [2024-10-11 02:36:44,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1864 transitions. [2024-10-11 02:36:44,768 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1864 transitions. Word has length 94 [2024-10-11 02:36:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:44,768 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1864 transitions. [2024-10-11 02:36:44,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (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-10-11 02:36:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1864 transitions. [2024-10-11 02:36:44,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:36:44,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:44,771 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:36:44,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:36:44,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:44,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:44,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1106390261, now seen corresponding path program 1 times [2024-10-11 02:36:44,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:44,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930992864] [2024-10-11 02:36:44,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:44,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:44,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:36:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:36:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:36:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:45,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:36:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:36:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:36:45,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:45,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930992864] [2024-10-11 02:36:45,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930992864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:45,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:45,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:36:45,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523694314] [2024-10-11 02:36:45,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:45,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:36:45,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:45,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:36:45,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:45,222 INFO L87 Difference]: Start difference. First operand 1110 states and 1864 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (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-10-11 02:36:48,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:48,964 INFO L93 Difference]: Finished difference Result 2566 states and 4371 transitions. [2024-10-11 02:36:48,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:36:48,965 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (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 95 [2024-10-11 02:36:48,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:48,972 INFO L225 Difference]: With dead ends: 2566 [2024-10-11 02:36:48,972 INFO L226 Difference]: Without dead ends: 1468 [2024-10-11 02:36:48,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:36:48,980 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1008 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 3165 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 3370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 3165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:48,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 1716 Invalid, 3370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 3165 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:36:48,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2024-10-11 02:36:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1110. [2024-10-11 02:36:49,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 859 states have (on average 1.6938300349243307) internal successors, (1455), 891 states have internal predecessors, (1455), 202 states have call successors, (202), 46 states have call predecessors, (202), 48 states have return successors, (206), 196 states have call predecessors, (206), 197 states have call successors, (206) [2024-10-11 02:36:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1863 transitions. [2024-10-11 02:36:49,230 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1863 transitions. Word has length 95 [2024-10-11 02:36:49,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:49,230 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1863 transitions. [2024-10-11 02:36:49,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (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-10-11 02:36:49,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1863 transitions. [2024-10-11 02:36:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:36:49,233 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:49,233 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:36:49,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:36:49,234 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:49,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:49,234 INFO L85 PathProgramCache]: Analyzing trace with hash -46713742, now seen corresponding path program 1 times [2024-10-11 02:36:49,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:49,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591128443] [2024-10-11 02:36:49,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:49,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:36:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:36:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:36:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:36:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:36:49,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:49,682 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:36:49,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:49,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591128443] [2024-10-11 02:36:49,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591128443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:49,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:49,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:36:49,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150993727] [2024-10-11 02:36:49,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:49,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:36:49,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:49,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:36:49,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:49,685 INFO L87 Difference]: Start difference. First operand 1110 states and 1863 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 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-10-11 02:36:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:53,514 INFO L93 Difference]: Finished difference Result 2566 states and 4370 transitions. [2024-10-11 02:36:53,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:36:53,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 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 96 [2024-10-11 02:36:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:53,521 INFO L225 Difference]: With dead ends: 2566 [2024-10-11 02:36:53,521 INFO L226 Difference]: Without dead ends: 1468 [2024-10-11 02:36:53,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:36:53,525 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 1006 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 3155 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 3362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 3155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:53,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 1705 Invalid, 3362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 3155 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-11 02:36:53,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2024-10-11 02:36:53,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 1110. [2024-10-11 02:36:53,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 859 states have (on average 1.6926658905704308) internal successors, (1454), 891 states have internal predecessors, (1454), 202 states have call successors, (202), 46 states have call predecessors, (202), 48 states have return successors, (206), 196 states have call predecessors, (206), 197 states have call successors, (206) [2024-10-11 02:36:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1862 transitions. [2024-10-11 02:36:53,682 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1862 transitions. Word has length 96 [2024-10-11 02:36:53,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:53,682 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1862 transitions. [2024-10-11 02:36:53,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 4 states have internal predecessors, (60), 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-10-11 02:36:53,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1862 transitions. [2024-10-11 02:36:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:36:53,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:53,685 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:36:53,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:36:53,685 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:53,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1055381743, now seen corresponding path program 1 times [2024-10-11 02:36:53,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:53,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848821438] [2024-10-11 02:36:53,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:53,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:53,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:53,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:36:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:36:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:54,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:36:54,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:36:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:36:54,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:54,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848821438] [2024-10-11 02:36:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848821438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:54,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:54,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:36:54,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503975887] [2024-10-11 02:36:54,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:54,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:36:54,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:54,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:36:54,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:36:54,239 INFO L87 Difference]: Start difference. First operand 1110 states and 1862 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 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-10-11 02:36:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:36:59,156 INFO L93 Difference]: Finished difference Result 2542 states and 4319 transitions. [2024-10-11 02:36:59,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 02:36:59,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 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 97 [2024-10-11 02:36:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:36:59,164 INFO L225 Difference]: With dead ends: 2542 [2024-10-11 02:36:59,165 INFO L226 Difference]: Without dead ends: 1492 [2024-10-11 02:36:59,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:36:59,170 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 2026 mSDsluCounter, 2462 mSDsCounter, 0 mSdLazyCounter, 5463 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 2907 SdHoareTripleChecker+Invalid, 6006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 5463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:36:59,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 2907 Invalid, 6006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 5463 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:36:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2024-10-11 02:36:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1122. [2024-10-11 02:36:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 868 states have (on average 1.6912442396313363) internal successors, (1468), 902 states have internal predecessors, (1468), 203 states have call successors, (203), 46 states have call predecessors, (203), 50 states have return successors, (209), 197 states have call predecessors, (209), 198 states have call successors, (209) [2024-10-11 02:36:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1880 transitions. [2024-10-11 02:36:59,337 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1880 transitions. Word has length 97 [2024-10-11 02:36:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:36:59,338 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1880 transitions. [2024-10-11 02:36:59,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 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-10-11 02:36:59,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1880 transitions. [2024-10-11 02:36:59,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:36:59,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:36:59,341 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:36:59,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:36:59,341 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:36:59,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:36:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash 112814512, now seen corresponding path program 1 times [2024-10-11 02:36:59,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:36:59,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969478703] [2024-10-11 02:36:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:36:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:36:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:36:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:36:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:36:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:36:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:36:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:36:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:36:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:36:59,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:36:59,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:36:59,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969478703] [2024-10-11 02:36:59,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969478703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:36:59,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:36:59,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:36:59,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723836638] [2024-10-11 02:36:59,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:36:59,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:36:59,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:36:59,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:36:59,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:36:59,807 INFO L87 Difference]: Start difference. First operand 1122 states and 1880 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 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-10-11 02:37:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:03,099 INFO L93 Difference]: Finished difference Result 2564 states and 4357 transitions. [2024-10-11 02:37:03,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:37:03,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 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 97 [2024-10-11 02:37:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:03,112 INFO L225 Difference]: With dead ends: 2564 [2024-10-11 02:37:03,112 INFO L226 Difference]: Without dead ends: 1498 [2024-10-11 02:37:03,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:37:03,115 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1992 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 2885 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2079 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 3419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 2885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:03,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2079 Valid, 1611 Invalid, 3419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 2885 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 02:37:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-10-11 02:37:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1122. [2024-10-11 02:37:03,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 868 states have (on average 1.685483870967742) internal successors, (1463), 902 states have internal predecessors, (1463), 203 states have call successors, (203), 46 states have call predecessors, (203), 50 states have return successors, (209), 197 states have call predecessors, (209), 198 states have call successors, (209) [2024-10-11 02:37:03,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1875 transitions. [2024-10-11 02:37:03,312 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1875 transitions. Word has length 97 [2024-10-11 02:37:03,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:03,312 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1875 transitions. [2024-10-11 02:37:03,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 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-10-11 02:37:03,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1875 transitions. [2024-10-11 02:37:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:37:03,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:03,316 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:37:03,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:37:03,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:03,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:03,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1497650637, now seen corresponding path program 1 times [2024-10-11 02:37:03,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:03,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915800811] [2024-10-11 02:37:03,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:03,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:37:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:03,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:37:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:03,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:37:03,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:03,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915800811] [2024-10-11 02:37:03,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915800811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:03,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:03,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:03,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614513787] [2024-10-11 02:37:03,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:03,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:03,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:03,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:03,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:03,737 INFO L87 Difference]: Start difference. First operand 1122 states and 1875 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 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-10-11 02:37:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:07,153 INFO L93 Difference]: Finished difference Result 2564 states and 4352 transitions. [2024-10-11 02:37:07,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:37:07,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 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 98 [2024-10-11 02:37:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:07,161 INFO L225 Difference]: With dead ends: 2564 [2024-10-11 02:37:07,161 INFO L226 Difference]: Without dead ends: 1498 [2024-10-11 02:37:07,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:37:07,165 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1538 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 2929 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 3302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:07,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 1657 Invalid, 3302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2929 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:37:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-10-11 02:37:07,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1122. [2024-10-11 02:37:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 868 states have (on average 1.6797235023041475) internal successors, (1458), 902 states have internal predecessors, (1458), 203 states have call successors, (203), 46 states have call predecessors, (203), 50 states have return successors, (209), 197 states have call predecessors, (209), 198 states have call successors, (209) [2024-10-11 02:37:07,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1870 transitions. [2024-10-11 02:37:07,372 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1870 transitions. Word has length 98 [2024-10-11 02:37:07,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:07,372 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1870 transitions. [2024-10-11 02:37:07,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 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-10-11 02:37:07,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1870 transitions. [2024-10-11 02:37:07,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:37:07,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:07,375 INFO L215 NwaCegarLoop]: trace histogram [3, 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-10-11 02:37:07,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:37:07,375 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:07,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:07,375 INFO L85 PathProgramCache]: Analyzing trace with hash 718136661, now seen corresponding path program 1 times [2024-10-11 02:37:07,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:07,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611317635] [2024-10-11 02:37:07,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:07,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:07,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:07,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:37:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:07,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:37:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:07,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:07,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:37:07,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:07,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611317635] [2024-10-11 02:37:07,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611317635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:07,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:07,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:07,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867861692] [2024-10-11 02:37:07,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:07,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:07,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:07,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:07,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:07,815 INFO L87 Difference]: Start difference. First operand 1122 states and 1870 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 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-10-11 02:37:11,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:11,110 INFO L93 Difference]: Finished difference Result 2564 states and 4347 transitions. [2024-10-11 02:37:11,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:37:11,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 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 99 [2024-10-11 02:37:11,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:11,117 INFO L225 Difference]: With dead ends: 2564 [2024-10-11 02:37:11,117 INFO L226 Difference]: Without dead ends: 1498 [2024-10-11 02:37:11,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:37:11,120 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 1540 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 2886 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 1640 SdHoareTripleChecker+Invalid, 3268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 2886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:11,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 1640 Invalid, 3268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 2886 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-11 02:37:11,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-10-11 02:37:11,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1122. [2024-10-11 02:37:11,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 868 states have (on average 1.673963133640553) internal successors, (1453), 902 states have internal predecessors, (1453), 203 states have call successors, (203), 46 states have call predecessors, (203), 50 states have return successors, (209), 197 states have call predecessors, (209), 198 states have call successors, (209) [2024-10-11 02:37:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1865 transitions. [2024-10-11 02:37:11,299 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1865 transitions. Word has length 99 [2024-10-11 02:37:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:11,299 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1865 transitions. [2024-10-11 02:37:11,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 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-10-11 02:37:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1865 transitions. [2024-10-11 02:37:11,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 02:37:11,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:11,302 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:37:11,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:37:11,302 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:11,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:11,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1538202920, now seen corresponding path program 1 times [2024-10-11 02:37:11,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:11,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275526863] [2024-10-11 02:37:11,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:11,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:37:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:37:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:11,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:11,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:37:11,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275526863] [2024-10-11 02:37:11,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275526863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:11,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:11,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:11,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452678695] [2024-10-11 02:37:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:11,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:11,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:11,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:11,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:11,811 INFO L87 Difference]: Start difference. First operand 1122 states and 1865 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 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-10-11 02:37:16,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:16,537 INFO L93 Difference]: Finished difference Result 2544 states and 4305 transitions. [2024-10-11 02:37:16,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:37:16,538 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 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 100 [2024-10-11 02:37:16,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:16,546 INFO L225 Difference]: With dead ends: 2544 [2024-10-11 02:37:16,546 INFO L226 Difference]: Without dead ends: 1492 [2024-10-11 02:37:16,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:37:16,549 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1964 mSDsluCounter, 2487 mSDsCounter, 0 mSdLazyCounter, 5270 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2052 SdHoareTripleChecker+Valid, 2939 SdHoareTripleChecker+Invalid, 5803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 5270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:16,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2052 Valid, 2939 Invalid, 5803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 5270 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-11 02:37:16,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1492 states. [2024-10-11 02:37:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1492 to 1122. [2024-10-11 02:37:16,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 868 states have (on average 1.672811059907834) internal successors, (1452), 902 states have internal predecessors, (1452), 203 states have call successors, (203), 46 states have call predecessors, (203), 50 states have return successors, (209), 197 states have call predecessors, (209), 198 states have call successors, (209) [2024-10-11 02:37:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1864 transitions. [2024-10-11 02:37:16,750 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1864 transitions. Word has length 100 [2024-10-11 02:37:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:16,750 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1864 transitions. [2024-10-11 02:37:16,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 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-10-11 02:37:16,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1864 transitions. [2024-10-11 02:37:16,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 02:37:16,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:16,753 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:37:16,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:37:16,753 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:16,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:16,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1288665528, now seen corresponding path program 1 times [2024-10-11 02:37:16,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:16,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070808388] [2024-10-11 02:37:16,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:16,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:16,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:37:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:37:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:17,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:17,133 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:37:17,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:17,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070808388] [2024-10-11 02:37:17,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070808388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:17,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:17,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:17,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117854619] [2024-10-11 02:37:17,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:17,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:17,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:17,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:17,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:17,134 INFO L87 Difference]: Start difference. First operand 1122 states and 1864 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 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-10-11 02:37:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:20,400 INFO L93 Difference]: Finished difference Result 2564 states and 4338 transitions. [2024-10-11 02:37:20,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:37:20,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 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 100 [2024-10-11 02:37:20,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:20,407 INFO L225 Difference]: With dead ends: 2564 [2024-10-11 02:37:20,407 INFO L226 Difference]: Without dead ends: 1498 [2024-10-11 02:37:20,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:37:20,409 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1982 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 2809 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2069 SdHoareTripleChecker+Valid, 1617 SdHoareTripleChecker+Invalid, 3340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 2809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:20,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2069 Valid, 1617 Invalid, 3340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 2809 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 02:37:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-10-11 02:37:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1122. [2024-10-11 02:37:20,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 868 states have (on average 1.6670506912442395) internal successors, (1447), 902 states have internal predecessors, (1447), 203 states have call successors, (203), 46 states have call predecessors, (203), 50 states have return successors, (209), 197 states have call predecessors, (209), 198 states have call successors, (209) [2024-10-11 02:37:20,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1859 transitions. [2024-10-11 02:37:20,592 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1859 transitions. Word has length 100 [2024-10-11 02:37:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:20,592 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1859 transitions. [2024-10-11 02:37:20,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 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-10-11 02:37:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1859 transitions. [2024-10-11 02:37:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:37:20,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:20,594 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:37:20,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:37:20,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:20,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:20,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1233828952, now seen corresponding path program 1 times [2024-10-11 02:37:20,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:20,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157557289] [2024-10-11 02:37:20,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:20,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:20,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:20,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:20,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:37:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:21,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:21,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:21,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:37:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:21,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:21,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:21,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:21,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:21,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:37:21,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:21,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157557289] [2024-10-11 02:37:21,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157557289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:21,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:21,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:37:21,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443649118] [2024-10-11 02:37:21,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:21,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:37:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:21,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:37:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:21,058 INFO L87 Difference]: Start difference. First operand 1122 states and 1859 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 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-10-11 02:37:25,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:25,603 INFO L93 Difference]: Finished difference Result 2552 states and 4308 transitions. [2024-10-11 02:37:25,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:37:25,603 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 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 101 [2024-10-11 02:37:25,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:25,610 INFO L225 Difference]: With dead ends: 2552 [2024-10-11 02:37:25,610 INFO L226 Difference]: Without dead ends: 1498 [2024-10-11 02:37:25,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:37:25,613 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 1951 mSDsluCounter, 2502 mSDsCounter, 0 mSdLazyCounter, 5263 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2039 SdHoareTripleChecker+Valid, 2959 SdHoareTripleChecker+Invalid, 5789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 5263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:25,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2039 Valid, 2959 Invalid, 5789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 5263 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:37:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-10-11 02:37:25,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1125. [2024-10-11 02:37:25,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 871 states have (on average 1.6636050516647531) internal successors, (1449), 905 states have internal predecessors, (1449), 203 states have call successors, (203), 46 states have call predecessors, (203), 50 states have return successors, (209), 197 states have call predecessors, (209), 198 states have call successors, (209) [2024-10-11 02:37:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1861 transitions. [2024-10-11 02:37:25,802 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1861 transitions. Word has length 101 [2024-10-11 02:37:25,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:25,802 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1861 transitions. [2024-10-11 02:37:25,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 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-10-11 02:37:25,803 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1861 transitions. [2024-10-11 02:37:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:37:25,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:25,805 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-10-11 02:37:25,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:37:25,805 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:25,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:25,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1899176710, now seen corresponding path program 1 times [2024-10-11 02:37:25,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:25,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271065236] [2024-10-11 02:37:25,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:25,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:25,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:25,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:25,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:25,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:37:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:37:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:26,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:26,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:37:26,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:26,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271065236] [2024-10-11 02:37:26,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271065236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:26,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:26,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618532078] [2024-10-11 02:37:26,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:26,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:26,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:26,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:26,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:26,214 INFO L87 Difference]: Start difference. First operand 1125 states and 1861 transitions. 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-10-11 02:37:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:29,648 INFO L93 Difference]: Finished difference Result 2573 states and 4338 transitions. [2024-10-11 02:37:29,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:37:29,649 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 101 [2024-10-11 02:37:29,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:29,657 INFO L225 Difference]: With dead ends: 2573 [2024-10-11 02:37:29,657 INFO L226 Difference]: Without dead ends: 1504 [2024-10-11 02:37:29,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:37:29,660 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1056 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 3017 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 1716 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 3017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:29,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 1716 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 3017 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:37:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states. [2024-10-11 02:37:29,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1125. [2024-10-11 02:37:29,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 871 states have (on average 1.6578645235361653) internal successors, (1444), 905 states have internal predecessors, (1444), 203 states have call successors, (203), 46 states have call predecessors, (203), 50 states have return successors, (209), 197 states have call predecessors, (209), 198 states have call successors, (209) [2024-10-11 02:37:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1856 transitions. [2024-10-11 02:37:29,854 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1856 transitions. Word has length 101 [2024-10-11 02:37:29,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:29,854 INFO L471 AbstractCegarLoop]: Abstraction has 1125 states and 1856 transitions. [2024-10-11 02:37:29,854 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-10-11 02:37:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1856 transitions. [2024-10-11 02:37:29,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 02:37:29,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:29,856 INFO L215 NwaCegarLoop]: trace histogram [3, 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-10-11 02:37:29,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:37:29,856 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:29,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:29,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1335135069, now seen corresponding path program 1 times [2024-10-11 02:37:29,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:29,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709137308] [2024-10-11 02:37:29,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:29,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:37:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:37:30,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:37:30,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:30,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709137308] [2024-10-11 02:37:30,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709137308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:30,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:30,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:30,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532595670] [2024-10-11 02:37:30,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:30,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:30,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:30,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:30,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:30,287 INFO L87 Difference]: Start difference. First operand 1125 states and 1856 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 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-10-11 02:37:33,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:33,632 INFO L93 Difference]: Finished difference Result 2556 states and 4305 transitions. [2024-10-11 02:37:33,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:37:33,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 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 102 [2024-10-11 02:37:33,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:33,640 INFO L225 Difference]: With dead ends: 2556 [2024-10-11 02:37:33,640 INFO L226 Difference]: Without dead ends: 1502 [2024-10-11 02:37:33,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:37:33,643 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 1937 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2024 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 3281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:33,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2024 Valid, 1622 Invalid, 3281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 02:37:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-10-11 02:37:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1129. [2024-10-11 02:37:33,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 875 states have (on average 1.6537142857142857) internal successors, (1447), 909 states have internal predecessors, (1447), 203 states have call successors, (203), 46 states have call predecessors, (203), 50 states have return successors, (209), 197 states have call predecessors, (209), 198 states have call successors, (209) [2024-10-11 02:37:33,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1859 transitions. [2024-10-11 02:37:33,858 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1859 transitions. Word has length 102 [2024-10-11 02:37:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:33,858 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1859 transitions. [2024-10-11 02:37:33,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 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-10-11 02:37:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1859 transitions. [2024-10-11 02:37:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 02:37:33,860 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:33,860 INFO L215 NwaCegarLoop]: trace histogram [3, 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-10-11 02:37:33,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:37:33,861 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:33,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1337438915, now seen corresponding path program 1 times [2024-10-11 02:37:33,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:33,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035267077] [2024-10-11 02:37:33,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:33,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:33,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:33,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:37:34,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:34,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:37:34,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:34,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:34,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:37:34,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:34,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035267077] [2024-10-11 02:37:34,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035267077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:34,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:34,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:34,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526236458] [2024-10-11 02:37:34,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:34,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:34,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:34,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:34,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:34,273 INFO L87 Difference]: Start difference. First operand 1129 states and 1859 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 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-10-11 02:37:37,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:37,860 INFO L93 Difference]: Finished difference Result 2611 states and 4368 transitions. [2024-10-11 02:37:37,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:37:37,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 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 102 [2024-10-11 02:37:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:37,868 INFO L225 Difference]: With dead ends: 2611 [2024-10-11 02:37:37,868 INFO L226 Difference]: Without dead ends: 1476 [2024-10-11 02:37:37,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:37:37,871 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 1434 mSDsluCounter, 1227 mSDsCounter, 0 mSdLazyCounter, 2925 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 2925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:37,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 1680 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 2925 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-11 02:37:37,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2024-10-11 02:37:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1111. [2024-10-11 02:37:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 860 states have (on average 1.658139534883721) internal successors, (1426), 892 states have internal predecessors, (1426), 202 states have call successors, (202), 46 states have call predecessors, (202), 48 states have return successors, (206), 196 states have call predecessors, (206), 197 states have call successors, (206) [2024-10-11 02:37:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1834 transitions. [2024-10-11 02:37:38,068 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1834 transitions. Word has length 102 [2024-10-11 02:37:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:38,068 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1834 transitions. [2024-10-11 02:37:38,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 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-10-11 02:37:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1834 transitions. [2024-10-11 02:37:38,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 02:37:38,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:38,070 INFO L215 NwaCegarLoop]: trace histogram [3, 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-10-11 02:37:38,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:37:38,070 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:38,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:38,071 INFO L85 PathProgramCache]: Analyzing trace with hash 248321405, now seen corresponding path program 1 times [2024-10-11 02:37:38,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:38,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176813237] [2024-10-11 02:37:38,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:38,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-11 02:37:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:37:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:38,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:37:38,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:38,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176813237] [2024-10-11 02:37:38,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176813237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:38,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:38,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33975089] [2024-10-11 02:37:38,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:38,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:38,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:38,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:38,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:38,522 INFO L87 Difference]: Start difference. First operand 1111 states and 1834 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 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-10-11 02:37:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:42,248 INFO L93 Difference]: Finished difference Result 2538 states and 4273 transitions. [2024-10-11 02:37:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:37:42,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 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 103 [2024-10-11 02:37:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:42,254 INFO L225 Difference]: With dead ends: 2538 [2024-10-11 02:37:42,255 INFO L226 Difference]: Without dead ends: 1486 [2024-10-11 02:37:42,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:37:42,258 INFO L432 NwaCegarLoop]: 455 mSDtfsCounter, 1002 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 2972 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 2972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:42,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 1733 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 2972 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 02:37:42,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2024-10-11 02:37:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1116. [2024-10-11 02:37:42,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 865 states have (on average 1.654335260115607) internal successors, (1431), 897 states have internal predecessors, (1431), 202 states have call successors, (202), 46 states have call predecessors, (202), 48 states have return successors, (206), 196 states have call predecessors, (206), 197 states have call successors, (206) [2024-10-11 02:37:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1839 transitions. [2024-10-11 02:37:42,460 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1839 transitions. Word has length 103 [2024-10-11 02:37:42,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:42,460 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1839 transitions. [2024-10-11 02:37:42,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 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-10-11 02:37:42,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1839 transitions. [2024-10-11 02:37:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:37:42,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:42,462 INFO L215 NwaCegarLoop]: trace histogram [3, 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-10-11 02:37:42,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:37:42,462 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:42,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1124166064, now seen corresponding path program 1 times [2024-10-11 02:37:42,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:42,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774174668] [2024-10-11 02:37:42,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:42,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:37:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:37:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 02:37:42,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:42,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774174668] [2024-10-11 02:37:42,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774174668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:42,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:42,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:37:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684230051] [2024-10-11 02:37:42,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:42,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:37:42,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:42,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:37:42,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:37:42,890 INFO L87 Difference]: Start difference. First operand 1116 states and 1839 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-10-11 02:37:46,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:46,396 INFO L93 Difference]: Finished difference Result 2548 states and 4282 transitions. [2024-10-11 02:37:46,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:37:46,397 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 104 [2024-10-11 02:37:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:46,403 INFO L225 Difference]: With dead ends: 2548 [2024-10-11 02:37:46,404 INFO L226 Difference]: Without dead ends: 1476 [2024-10-11 02:37:46,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:37:46,407 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 1474 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 2790 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 3160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 2790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:37:46,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 1663 Invalid, 3160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 2790 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-11 02:37:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2024-10-11 02:37:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1116. [2024-10-11 02:37:46,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 865 states have (on average 1.6497109826589595) internal successors, (1427), 897 states have internal predecessors, (1427), 202 states have call successors, (202), 46 states have call predecessors, (202), 48 states have return successors, (206), 196 states have call predecessors, (206), 197 states have call successors, (206) [2024-10-11 02:37:46,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1835 transitions. [2024-10-11 02:37:46,645 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1835 transitions. Word has length 104 [2024-10-11 02:37:46,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:37:46,645 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1835 transitions. [2024-10-11 02:37:46,646 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-10-11 02:37:46,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1835 transitions. [2024-10-11 02:37:46,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:37:46,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:37:46,647 INFO L215 NwaCegarLoop]: trace histogram [3, 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-10-11 02:37:46,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:37:46,648 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:37:46,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:37:46,648 INFO L85 PathProgramCache]: Analyzing trace with hash -2028298766, now seen corresponding path program 1 times [2024-10-11 02:37:46,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:37:46,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116704970] [2024-10-11 02:37:46,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:37:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:37:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:46,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:37:46,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:46,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:46,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:37:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:47,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:47,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:47,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:47,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:47,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:37:47,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:47,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:37:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:47,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:37:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:47,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:37:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:47,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:37:47,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:37:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-11 02:37:47,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:37:47,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116704970] [2024-10-11 02:37:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116704970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:37:47,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:37:47,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:37:47,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965937778] [2024-10-11 02:37:47,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:37:47,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:37:47,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:37:47,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:37:47,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:37:47,142 INFO L87 Difference]: Start difference. First operand 1116 states and 1835 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:37:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:37:51,547 INFO L93 Difference]: Finished difference Result 2527 states and 4343 transitions. [2024-10-11 02:37:51,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:37:51,548 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), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 104 [2024-10-11 02:37:51,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:37:51,556 INFO L225 Difference]: With dead ends: 2527 [2024-10-11 02:37:51,556 INFO L226 Difference]: Without dead ends: 1482 [2024-10-11 02:37:51,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240