./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4eb5ae4a2b95fd78cf87e688565203c0839d6de752e442a1cce7638954224909 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:18:42,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:18:43,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:18:43,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:18:43,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:18:43,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:18:43,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:18:43,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:18:43,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:18:43,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:18:43,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:18:43,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:18:43,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:18:43,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:18:43,055 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:18:43,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:18:43,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:18:43,056 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:18:43,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:18:43,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:18:43,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:18:43,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:18:43,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:18:43,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:18:43,061 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:18:43,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:18:43,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:18:43,062 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:18:43,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:18:43,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:18:43,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:18:43,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:18:43,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:18:43,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:18:43,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:18:43,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:18:43,066 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:18:43,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:18:43,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:18:43,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:18:43,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:18:43,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:18:43,072 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4eb5ae4a2b95fd78cf87e688565203c0839d6de752e442a1cce7638954224909 [2024-10-12 19:18:43,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:18:43,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:18:43,340 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:18:43,341 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:18:43,342 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:18:43,343 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c [2024-10-12 19:18:44,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:18:45,046 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:18:45,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c [2024-10-12 19:18:45,065 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7abc8ee8/a2394a54a9c84c8090de6a11a88b7c94/FLAG91a2db1c5 [2024-10-12 19:18:45,316 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7abc8ee8/a2394a54a9c84c8090de6a11a88b7c94 [2024-10-12 19:18:45,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:18:45,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:18:45,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:18:45,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:18:45,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:18:45,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:18:45" (1/1) ... [2024-10-12 19:18:45,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ac722b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:45, skipping insertion in model container [2024-10-12 19:18:45,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:18:45" (1/1) ... [2024-10-12 19:18:45,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:18:45,901 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c[55726,55739] [2024-10-12 19:18:45,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:18:45,956 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:18:45,966 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-10-12 19:18:45,968 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [408] [2024-10-12 19:18:45,968 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [423] [2024-10-12 19:18:45,969 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [789] [2024-10-12 19:18:45,969 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [2329] [2024-10-12 19:18:45,969 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2447] [2024-10-12 19:18:45,969 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2482] [2024-10-12 19:18:45,970 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2669] [2024-10-12 19:18:45,970 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [2678] [2024-10-12 19:18:45,971 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2769] [2024-10-12 19:18:46,050 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product19.cil.c[55726,55739] [2024-10-12 19:18:46,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:18:46,101 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:18:46,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46 WrapperNode [2024-10-12 19:18:46,102 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:18:46,103 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:18:46,103 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:18:46,103 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:18:46,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,147 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,201 INFO L138 Inliner]: procedures = 92, calls = 346, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1090 [2024-10-12 19:18:46,202 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:18:46,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:18:46,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:18:46,206 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:18:46,221 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,232 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,264 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-12 19:18:46,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,300 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:18:46,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:18:46,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:18:46,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:18:46,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (1/1) ... [2024-10-12 19:18:46,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:18:46,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:18:46,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 19:18:46,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 19:18:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:18:46,448 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-12 19:18:46,448 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-12 19:18:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-12 19:18:46,449 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-12 19:18:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-10-12 19:18:46,449 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2024-10-12 19:18:46,449 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-12 19:18:46,450 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-12 19:18:46,450 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-12 19:18:46,450 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-12 19:18:46,450 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-12 19:18:46,451 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-12 19:18:46,451 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-12 19:18:46,451 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-12 19:18:46,452 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-12 19:18:46,452 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-12 19:18:46,452 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-12 19:18:46,452 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-12 19:18:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-12 19:18:46,453 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-12 19:18:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:18:46,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:18:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-12 19:18:46,453 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-12 19:18:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-12 19:18:46,454 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-12 19:18:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-12 19:18:46,454 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-12 19:18:46,455 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-12 19:18:46,455 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-12 19:18:46,455 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-12 19:18:46,455 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-12 19:18:46,455 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-12 19:18:46,455 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-12 19:18:46,455 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-12 19:18:46,456 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-12 19:18:46,456 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-12 19:18:46,456 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-12 19:18:46,456 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-12 19:18:46,456 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-12 19:18:46,456 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-12 19:18:46,456 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-12 19:18:46,457 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-12 19:18:46,457 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-12 19:18:46,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:18:46,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:18:46,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:18:46,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:18:46,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-12 19:18:46,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-12 19:18:46,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-12 19:18:46,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-12 19:18:46,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-12 19:18:46,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-12 19:18:46,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-12 19:18:46,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-12 19:18:46,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-12 19:18:46,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-12 19:18:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-12 19:18:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-12 19:18:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-12 19:18:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-12 19:18:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-12 19:18:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-12 19:18:46,461 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-12 19:18:46,462 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-12 19:18:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-12 19:18:46,462 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-12 19:18:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-12 19:18:46,462 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-12 19:18:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-12 19:18:46,462 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-12 19:18:46,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:18:46,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:18:46,463 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-12 19:18:46,463 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-12 19:18:46,662 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:18:46,664 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:18:47,846 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2024-10-12 19:18:47,846 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:18:47,930 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:18:47,932 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:18:47,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:18:47 BoogieIcfgContainer [2024-10-12 19:18:47,933 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:18:47,934 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:18:47,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:18:47,938 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:18:47,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:18:45" (1/3) ... [2024-10-12 19:18:47,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e946ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:18:47, skipping insertion in model container [2024-10-12 19:18:47,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:18:46" (2/3) ... [2024-10-12 19:18:47,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e946ba6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:18:47, skipping insertion in model container [2024-10-12 19:18:47,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:18:47" (3/3) ... [2024-10-12 19:18:47,941 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product19.cil.c [2024-10-12 19:18:47,957 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:18:47,958 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:18:48,046 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:18:48,054 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;@29586b0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:18:48,056 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:18:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand has 567 states, 430 states have (on average 1.7023255813953488) internal successors, (732), 448 states have internal predecessors, (732), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2024-10-12 19:18:48,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-12 19:18:48,099 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:48,100 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:48,101 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:48,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash 529877195, now seen corresponding path program 1 times [2024-10-12 19:18:48,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:48,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690025402] [2024-10-12 19:18:48,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:48,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:48,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:49,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:18:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:18:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-12 19:18:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:18:49,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-12 19:18:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:49,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:18:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:18:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:18:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 19:18:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:18:49,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:49,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690025402] [2024-10-12 19:18:49,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690025402] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:49,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:49,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:18:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921485819] [2024-10-12 19:18:49,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:49,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:18:49,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:49,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:18:49,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:18:49,540 INFO L87 Difference]: Start difference. First operand has 567 states, 430 states have (on average 1.7023255813953488) internal successors, (732), 448 states have internal predecessors, (732), 108 states have call successors, (108), 27 states have call predecessors, (108), 27 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:18:57,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:18:57,885 INFO L93 Difference]: Finished difference Result 1472 states and 2571 transitions. [2024-10-12 19:18:57,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:18:57,888 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 101 [2024-10-12 19:18:57,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:18:57,917 INFO L225 Difference]: With dead ends: 1472 [2024-10-12 19:18:57,918 INFO L226 Difference]: Without dead ends: 902 [2024-10-12 19:18:57,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:18:57,934 INFO L432 NwaCegarLoop]: 454 mSDtfsCounter, 1139 mSDsluCounter, 2504 mSDsCounter, 0 mSdLazyCounter, 5696 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1253 SdHoareTripleChecker+Valid, 2958 SdHoareTripleChecker+Invalid, 5968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 5696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:18:57,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1253 Valid, 2958 Invalid, 5968 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [272 Valid, 5696 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-10-12 19:18:57,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-12 19:18:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 573. [2024-10-12 19:18:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 436 states have (on average 1.688073394495413) internal successors, (736), 454 states have internal predecessors, (736), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 104 states have call predecessors, (108), 106 states have call successors, (108) [2024-10-12 19:18:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 953 transitions. [2024-10-12 19:18:58,272 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 953 transitions. Word has length 101 [2024-10-12 19:18:58,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:18:58,274 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 953 transitions. [2024-10-12 19:18:58,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:18:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 953 transitions. [2024-10-12 19:18:58,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 19:18:58,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:18:58,281 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:18:58,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 19:18:58,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:18:58,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:18:58,283 INFO L85 PathProgramCache]: Analyzing trace with hash 737264536, now seen corresponding path program 1 times [2024-10-12 19:18:58,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:18:58,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310610368] [2024-10-12 19:18:58,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:18:58,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:18:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:18:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:18:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:58,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:18:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:18:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:18:59,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:18:59,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:59,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:18:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:18:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:59,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:18:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:18:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:18:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:18:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:18:59,087 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:18:59,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:18:59,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310610368] [2024-10-12 19:18:59,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310610368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:18:59,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:18:59,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:18:59,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594246012] [2024-10-12 19:18:59,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:18:59,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:18:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:18:59,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:18:59,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:18:59,092 INFO L87 Difference]: Start difference. First operand 573 states and 953 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, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 19:19:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:04,385 INFO L93 Difference]: Finished difference Result 1461 states and 2514 transitions. [2024-10-12 19:19:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:19:04,386 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, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2024-10-12 19:19:04,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:04,393 INFO L225 Difference]: With dead ends: 1461 [2024-10-12 19:19:04,393 INFO L226 Difference]: Without dead ends: 898 [2024-10-12 19:19:04,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:19:04,398 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 1632 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 2877 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 2877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:04,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 1507 Invalid, 3366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 2877 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-12 19:19:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2024-10-12 19:19:04,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 573. [2024-10-12 19:19:04,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 436 states have (on average 1.6857798165137614) internal successors, (735), 454 states have internal predecessors, (735), 109 states have call successors, (109), 27 states have call predecessors, (109), 27 states have return successors, (108), 104 states have call predecessors, (108), 106 states have call successors, (108) [2024-10-12 19:19:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 952 transitions. [2024-10-12 19:19:04,570 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 952 transitions. Word has length 102 [2024-10-12 19:19:04,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:04,570 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 952 transitions. [2024-10-12 19:19:04,571 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, (17), 5 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 19:19:04,571 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 952 transitions. [2024-10-12 19:19:04,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-12 19:19:04,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:04,577 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:04,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 19:19:04,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:04,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1684876880, now seen corresponding path program 1 times [2024-10-12 19:19:04,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:04,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345151978] [2024-10-12 19:19:04,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:04,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:04,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:04,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:19:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-12 19:19:05,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:19:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-12 19:19:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:19:05,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:19:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:19:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:19:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:19:05,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:05,150 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:19:05,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:05,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345151978] [2024-10-12 19:19:05,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345151978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:05,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:05,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:19:05,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899002814] [2024-10-12 19:19:05,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:05,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:19:05,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:05,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:19:05,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:19:05,155 INFO L87 Difference]: Start difference. First operand 573 states and 952 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, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 19:19:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:10,304 INFO L93 Difference]: Finished difference Result 1459 states and 2503 transitions. [2024-10-12 19:19:10,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:19:10,305 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, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2024-10-12 19:19:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:10,311 INFO L225 Difference]: With dead ends: 1459 [2024-10-12 19:19:10,311 INFO L226 Difference]: Without dead ends: 867 [2024-10-12 19:19:10,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:19:10,315 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1023 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1136 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 3375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:10,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1136 Valid, 1596 Invalid, 3375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 19:19:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-10-12 19:19:10,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 550. [2024-10-12 19:19:10,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 416 states have (on average 1.6754807692307692) internal successors, (697), 432 states have internal predecessors, (697), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-12 19:19:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 910 transitions. [2024-10-12 19:19:10,468 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 910 transitions. Word has length 102 [2024-10-12 19:19:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:10,468 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 910 transitions. [2024-10-12 19:19:10,468 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, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-12 19:19:10,469 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 910 transitions. [2024-10-12 19:19:10,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-12 19:19:10,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:10,475 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:10,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 19:19:10,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:10,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1261917111, now seen corresponding path program 1 times [2024-10-12 19:19:10,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:10,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944851348] [2024-10-12 19:19:10,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:10,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:19:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:19:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:19:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:19:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:19:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:19:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:19:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:19:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:11,173 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:19:11,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:11,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944851348] [2024-10-12 19:19:11,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944851348] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:11,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:11,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:11,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487808525] [2024-10-12 19:19:11,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:11,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:11,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:11,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:11,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:11,176 INFO L87 Difference]: Start difference. First operand 550 states and 910 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, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:17,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:17,335 INFO L93 Difference]: Finished difference Result 1423 states and 2435 transitions. [2024-10-12 19:19:17,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:19:17,336 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, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 103 [2024-10-12 19:19:17,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:17,341 INFO L225 Difference]: With dead ends: 1423 [2024-10-12 19:19:17,341 INFO L226 Difference]: Without dead ends: 861 [2024-10-12 19:19:17,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:19:17,345 INFO L432 NwaCegarLoop]: 426 mSDtfsCounter, 2148 mSDsluCounter, 2278 mSDsCounter, 0 mSdLazyCounter, 5194 mSolverCounterSat, 702 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 5896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 702 IncrementalHoareTripleChecker+Valid, 5194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:17,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2260 Valid, 2704 Invalid, 5896 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [702 Valid, 5194 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-12 19:19:17,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-12 19:19:17,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 544. [2024-10-12 19:19:17,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 410 states have (on average 1.6682926829268292) internal successors, (684), 426 states have internal predecessors, (684), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-12 19:19:17,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 897 transitions. [2024-10-12 19:19:17,478 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 897 transitions. Word has length 103 [2024-10-12 19:19:17,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:17,478 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 897 transitions. [2024-10-12 19:19:17,479 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, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 897 transitions. [2024-10-12 19:19:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 19:19:17,481 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:17,481 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:17,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 19:19:17,482 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:17,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:17,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1129528224, now seen corresponding path program 1 times [2024-10-12 19:19:17,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:17,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276037700] [2024-10-12 19:19:17,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:17,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:17,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:17,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:17,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:19:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:19:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:19:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:19:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:19:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:19:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:19:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:19:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:19:18,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:18,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276037700] [2024-10-12 19:19:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276037700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:18,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:18,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:18,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679231031] [2024-10-12 19:19:18,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:18,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:18,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:18,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:18,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:18,139 INFO L87 Difference]: Start difference. First operand 544 states and 897 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:24,231 INFO L93 Difference]: Finished difference Result 1395 states and 2386 transitions. [2024-10-12 19:19:24,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:19:24,232 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 104 [2024-10-12 19:19:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:24,237 INFO L225 Difference]: With dead ends: 1395 [2024-10-12 19:19:24,237 INFO L226 Difference]: Without dead ends: 861 [2024-10-12 19:19:24,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:19:24,241 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 1019 mSDsluCounter, 2423 mSDsCounter, 0 mSdLazyCounter, 5338 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 2865 SdHoareTripleChecker+Invalid, 5611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 5338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:24,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 2865 Invalid, 5611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 5338 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-12 19:19:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-12 19:19:24,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 544. [2024-10-12 19:19:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 410 states have (on average 1.6658536585365853) internal successors, (683), 426 states have internal predecessors, (683), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-12 19:19:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 896 transitions. [2024-10-12 19:19:24,364 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 896 transitions. Word has length 104 [2024-10-12 19:19:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:24,365 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 896 transitions. [2024-10-12 19:19:24,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:24,365 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 896 transitions. [2024-10-12 19:19:24,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 19:19:24,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:24,368 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:24,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 19:19:24,368 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:24,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:24,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1137788916, now seen corresponding path program 1 times [2024-10-12 19:19:24,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:24,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297398428] [2024-10-12 19:19:24,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:24,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:24,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:24,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:24,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:24,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:24,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:24,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:24,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:24,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:24,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:24,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:19:24,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:24,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:19:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:24,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:19:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:24,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:24,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:19:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:19:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:25,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:19:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:25,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:19:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:25,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:19:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:25,021 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:19:25,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:25,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297398428] [2024-10-12 19:19:25,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297398428] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:25,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:25,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415465287] [2024-10-12 19:19:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:25,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:25,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:25,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:25,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:25,024 INFO L87 Difference]: Start difference. First operand 544 states and 896 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:30,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:30,791 INFO L93 Difference]: Finished difference Result 1411 states and 2404 transitions. [2024-10-12 19:19:30,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:19:30,792 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 105 [2024-10-12 19:19:30,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:30,797 INFO L225 Difference]: With dead ends: 1411 [2024-10-12 19:19:30,797 INFO L226 Difference]: Without dead ends: 855 [2024-10-12 19:19:30,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:19:30,801 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 2087 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 5133 mSolverCounterSat, 697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2200 SdHoareTripleChecker+Valid, 2796 SdHoareTripleChecker+Invalid, 5830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 697 IncrementalHoareTripleChecker+Valid, 5133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:30,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2200 Valid, 2796 Invalid, 5830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [697 Valid, 5133 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 19:19:30,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-12 19:19:30,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 538. [2024-10-12 19:19:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 404 states have (on average 1.6584158415841583) internal successors, (670), 420 states have internal predecessors, (670), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-12 19:19:30,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 883 transitions. [2024-10-12 19:19:30,931 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 883 transitions. Word has length 105 [2024-10-12 19:19:30,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:30,931 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 883 transitions. [2024-10-12 19:19:30,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:30,931 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 883 transitions. [2024-10-12 19:19:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 19:19:30,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:30,933 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:30,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:19:30,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:30,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:30,934 INFO L85 PathProgramCache]: Analyzing trace with hash 838695105, now seen corresponding path program 1 times [2024-10-12 19:19:30,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:30,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079028612] [2024-10-12 19:19:30,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:30,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:30,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:19:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-12 19:19:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:19:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:19:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:19:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:19:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:19:31,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:19:31,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:31,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:19:31,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:31,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079028612] [2024-10-12 19:19:31,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079028612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:31,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:31,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:31,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933254312] [2024-10-12 19:19:31,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:31,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:31,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:31,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:31,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:31,496 INFO L87 Difference]: Start difference. First operand 538 states and 883 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, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:37,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:37,091 INFO L93 Difference]: Finished difference Result 1383 states and 2357 transitions. [2024-10-12 19:19:37,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:19:37,092 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, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 106 [2024-10-12 19:19:37,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:37,096 INFO L225 Difference]: With dead ends: 1383 [2024-10-12 19:19:37,097 INFO L226 Difference]: Without dead ends: 855 [2024-10-12 19:19:37,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:19:37,099 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 2013 mSDsluCounter, 2393 mSDsCounter, 0 mSdLazyCounter, 5057 mSolverCounterSat, 693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2125 SdHoareTripleChecker+Valid, 2843 SdHoareTripleChecker+Invalid, 5750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 693 IncrementalHoareTripleChecker+Valid, 5057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:37,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2125 Valid, 2843 Invalid, 5750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [693 Valid, 5057 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 19:19:37,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-12 19:19:37,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 538. [2024-10-12 19:19:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 404 states have (on average 1.6559405940594059) internal successors, (669), 420 states have internal predecessors, (669), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-12 19:19:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 882 transitions. [2024-10-12 19:19:37,225 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 882 transitions. Word has length 106 [2024-10-12 19:19:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:37,225 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 882 transitions. [2024-10-12 19:19:37,226 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, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 882 transitions. [2024-10-12 19:19:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 19:19:37,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:37,228 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:37,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:19:37,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:37,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1312496184, now seen corresponding path program 1 times [2024-10-12 19:19:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:37,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851665235] [2024-10-12 19:19:37,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:37,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:37,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:19:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:19:37,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:19:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:37,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:19:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:19:37,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:37,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:19:37,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:19:37,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:19:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:19:37,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:37,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851665235] [2024-10-12 19:19:37,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851665235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:37,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:37,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:37,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073677804] [2024-10-12 19:19:37,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:37,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:37,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:37,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:37,868 INFO L87 Difference]: Start difference. First operand 538 states and 882 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, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:43,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:43,564 INFO L93 Difference]: Finished difference Result 1399 states and 2373 transitions. [2024-10-12 19:19:43,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-12 19:19:43,564 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, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 107 [2024-10-12 19:19:43,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:43,570 INFO L225 Difference]: With dead ends: 1399 [2024-10-12 19:19:43,570 INFO L226 Difference]: Without dead ends: 849 [2024-10-12 19:19:43,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-12 19:19:43,573 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 1550 mSDsluCounter, 2320 mSDsCounter, 0 mSdLazyCounter, 5061 mSolverCounterSat, 496 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 5557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 496 IncrementalHoareTripleChecker+Valid, 5061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:43,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 2749 Invalid, 5557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [496 Valid, 5061 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-12 19:19:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-12 19:19:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 532. [2024-10-12 19:19:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 398 states have (on average 1.6482412060301508) internal successors, (656), 414 states have internal predecessors, (656), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-12 19:19:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 869 transitions. [2024-10-12 19:19:43,686 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 869 transitions. Word has length 107 [2024-10-12 19:19:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:43,687 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 869 transitions. [2024-10-12 19:19:43,687 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, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 869 transitions. [2024-10-12 19:19:43,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 19:19:43,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:43,689 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:43,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:19:43,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:43,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:43,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1819571113, now seen corresponding path program 1 times [2024-10-12 19:19:43,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:43,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367040284] [2024-10-12 19:19:43,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:43,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:44,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:19:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-12 19:19:44,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:19:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:19:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:19:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:19:44,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:19:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:19:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:44,277 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:19:44,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367040284] [2024-10-12 19:19:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367040284] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:44,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:44,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:44,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007344603] [2024-10-12 19:19:44,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:44,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:44,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:44,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:44,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:44,280 INFO L87 Difference]: Start difference. First operand 532 states and 869 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, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:49,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:49,740 INFO L93 Difference]: Finished difference Result 1371 states and 2328 transitions. [2024-10-12 19:19:49,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:19:49,741 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, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 107 [2024-10-12 19:19:49,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:49,746 INFO L225 Difference]: With dead ends: 1371 [2024-10-12 19:19:49,746 INFO L226 Difference]: Without dead ends: 849 [2024-10-12 19:19:49,748 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:19:49,749 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 1989 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 4841 mSolverCounterSat, 705 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2102 SdHoareTripleChecker+Valid, 2801 SdHoareTripleChecker+Invalid, 5546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 705 IncrementalHoareTripleChecker+Valid, 4841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:49,749 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2102 Valid, 2801 Invalid, 5546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [705 Valid, 4841 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-12 19:19:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-12 19:19:49,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 532. [2024-10-12 19:19:49,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 398 states have (on average 1.6457286432160805) internal successors, (655), 414 states have internal predecessors, (655), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-12 19:19:49,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 868 transitions. [2024-10-12 19:19:49,910 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 868 transitions. Word has length 107 [2024-10-12 19:19:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:49,911 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 868 transitions. [2024-10-12 19:19:49,911 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, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 868 transitions. [2024-10-12 19:19:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 19:19:49,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:49,913 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:49,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:19:49,916 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:49,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:49,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1111221415, now seen corresponding path program 1 times [2024-10-12 19:19:49,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:49,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725491884] [2024-10-12 19:19:49,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:50,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:19:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:19:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:19:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:19:50,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:19:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:19:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:19:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:19:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:19:50,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:50,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725491884] [2024-10-12 19:19:50,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725491884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:50,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:50,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046993751] [2024-10-12 19:19:50,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:50,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:50,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:50,532 INFO L87 Difference]: Start difference. First operand 532 states and 868 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:56,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:19:56,390 INFO L93 Difference]: Finished difference Result 1377 states and 2332 transitions. [2024-10-12 19:19:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:19:56,390 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 108 [2024-10-12 19:19:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:19:56,396 INFO L225 Difference]: With dead ends: 1377 [2024-10-12 19:19:56,396 INFO L226 Difference]: Without dead ends: 855 [2024-10-12 19:19:56,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:19:56,398 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 962 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 5071 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 5346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 5071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:19:56,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 2787 Invalid, 5346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 5071 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-12 19:19:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-12 19:19:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 538. [2024-10-12 19:19:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 404 states have (on average 1.636138613861386) internal successors, (661), 420 states have internal predecessors, (661), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-12 19:19:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 874 transitions. [2024-10-12 19:19:56,535 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 874 transitions. Word has length 108 [2024-10-12 19:19:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:19:56,535 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 874 transitions. [2024-10-12 19:19:56,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:19:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 874 transitions. [2024-10-12 19:19:56,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 19:19:56,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:19:56,538 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:19:56,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:19:56,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:19:56,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:19:56,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1351461161, now seen corresponding path program 1 times [2024-10-12 19:19:56,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:19:56,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294429922] [2024-10-12 19:19:56,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:19:56,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:19:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:19:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:56,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:56,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:56,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:19:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:19:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-12 19:19:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-12 19:19:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:19:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:19:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:19:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:19:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:19:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:19:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:19:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:19:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-12 19:19:57,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:19:57,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294429922] [2024-10-12 19:19:57,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294429922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:19:57,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:19:57,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:19:57,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422263866] [2024-10-12 19:19:57,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:19:57,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:19:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:19:57,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:19:57,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:19:57,123 INFO L87 Difference]: Start difference. First operand 538 states and 874 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:20:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:03,080 INFO L93 Difference]: Finished difference Result 1385 states and 2338 transitions. [2024-10-12 19:20:03,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:20:03,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 108 [2024-10-12 19:20:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:03,085 INFO L225 Difference]: With dead ends: 1385 [2024-10-12 19:20:03,085 INFO L226 Difference]: Without dead ends: 849 [2024-10-12 19:20:03,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-12 19:20:03,088 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 957 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 5142 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 5411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 5142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:03,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 2926 Invalid, 5411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 5142 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-12 19:20:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-12 19:20:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 532. [2024-10-12 19:20:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 398 states have (on average 1.64321608040201) internal successors, (654), 414 states have internal predecessors, (654), 108 states have call successors, (108), 27 states have call predecessors, (108), 25 states have return successors, (105), 103 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-12 19:20:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 867 transitions. [2024-10-12 19:20:03,247 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 867 transitions. Word has length 108 [2024-10-12 19:20:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:03,247 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 867 transitions. [2024-10-12 19:20:03,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:20:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 867 transitions. [2024-10-12 19:20:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 19:20:03,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:03,250 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:20:03,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:20:03,250 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:20:03,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:20:03,250 INFO L85 PathProgramCache]: Analyzing trace with hash 591427869, now seen corresponding path program 1 times [2024-10-12 19:20:03,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:20:03,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405495548] [2024-10-12 19:20:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:03,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:20:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:20:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-12 19:20:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-12 19:20:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-12 19:20:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:20:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:20:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:03,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:20:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:20:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-12 19:20:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-12 19:20:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:20:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:20:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:03,830 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 19:20:03,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:20:03,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405495548] [2024-10-12 19:20:03,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405495548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:20:03,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841851375] [2024-10-12 19:20:03,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:20:03,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:20:03,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:20:03,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 19:20:03,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 19:20:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:20:04,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:20:04,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:20:04,244 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-12 19:20:04,244 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:20:04,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841851375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:20:04,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:20:04,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-12 19:20:04,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198247477] [2024-10-12 19:20:04,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:20:04,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:20:04,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:20:04,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:20:04,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:20:04,247 INFO L87 Difference]: Start difference. First operand 532 states and 867 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:20:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:20:04,526 INFO L93 Difference]: Finished difference Result 1519 states and 2501 transitions. [2024-10-12 19:20:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:20:04,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 109 [2024-10-12 19:20:04,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:20:04,532 INFO L225 Difference]: With dead ends: 1519 [2024-10-12 19:20:04,532 INFO L226 Difference]: Without dead ends: 999 [2024-10-12 19:20:04,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:20:04,535 INFO L432 NwaCegarLoop]: 1523 mSDtfsCounter, 794 mSDsluCounter, 756 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 794 SdHoareTripleChecker+Valid, 2279 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:20:04,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [794 Valid, 2279 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:20:04,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2024-10-12 19:20:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 985. [2024-10-12 19:20:04,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 745 states have (on average 1.6523489932885906) internal successors, (1231), 776 states have internal predecessors, (1231), 191 states have call successors, (191), 49 states have call predecessors, (191), 48 states have return successors, (193), 185 states have call predecessors, (193), 188 states have call successors, (193) [2024-10-12 19:20:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1615 transitions. [2024-10-12 19:20:04,781 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1615 transitions. Word has length 109 [2024-10-12 19:20:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:20:04,781 INFO L471 AbstractCegarLoop]: Abstraction has 985 states and 1615 transitions. [2024-10-12 19:20:04,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 3 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-12 19:20:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1615 transitions. [2024-10-12 19:20:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 19:20:04,784 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:20:04,784 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:20:04,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0