./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:38:52,158 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:38:52,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:38:52,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:38:52,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:38:52,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:38:52,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:38:52,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:38:52,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:38:52,251 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:38:52,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:38:52,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:38:52,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:38:52,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:38:52,257 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:38:52,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:38:52,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:38:52,258 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:38:52,258 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:38:52,258 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:38:52,259 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:38:52,259 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:38:52,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:38:52,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:38:52,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:38:52,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:38:52,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:38:52,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:38:52,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:38:52,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:38:52,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:38:52,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:38:52,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:38:52,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:38:52,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:38:52,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:38:52,263 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:38:52,263 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:38:52,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:38:52,264 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:38:52,264 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:38:52,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:38:52,265 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 68864d90c2581c7e2b9a72172352bcf9279d03107788434bd4ac5af6cc5db51a [2024-10-11 02:38:52,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:38:52,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:38:52,522 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:38:52,523 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:38:52,524 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:38:52,525 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2024-10-11 02:38:54,031 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:38:54,375 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:38:54,377 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product25.cil.c [2024-10-11 02:38:54,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/78f42d0dc/6265f4860a514a5a92d5bffd763dd505/FLAG334ffda40 [2024-10-11 02:38:54,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/78f42d0dc/6265f4860a514a5a92d5bffd763dd505 [2024-10-11 02:38:54,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:38:54,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:38:54,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:38:54,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:38:54,435 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:38:54,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:38:54" (1/1) ... [2024-10-11 02:38:54,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@233eb859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:54, skipping insertion in model container [2024-10-11 02:38:54,438 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:38:54" (1/1) ... [2024-10-11 02:38:54,504 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:38:54,933 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_spec9_product25.cil.c[23488,23501] [2024-10-11 02:38:55,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:38:55,078 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:38:55,087 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [48] [2024-10-11 02:38:55,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [213] [2024-10-11 02:38:55,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [334] [2024-10-11 02:38:55,089 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [432] [2024-10-11 02:38:55,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [446] [2024-10-11 02:38:55,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [812] [2024-10-11 02:38:55,090 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1166] [2024-10-11 02:38:55,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1175] [2024-10-11 02:38:55,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1842] [2024-10-11 02:38:55,092 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1877] [2024-10-11 02:38:55,144 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_spec9_product25.cil.c[23488,23501] [2024-10-11 02:38:55,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:38:55,225 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:38:55,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55 WrapperNode [2024-10-11 02:38:55,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:38:55,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:38:55,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:38:55,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:38:55,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,266 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,310 INFO L138 Inliner]: procedures = 91, calls = 331, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 804 [2024-10-11 02:38:55,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:38:55,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:38:55,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:38:55,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:38:55,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,363 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-11 02:38:55,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,412 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:38:55,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:38:55,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:38:55,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:38:55,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (1/1) ... [2024-10-11 02:38:55,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:38:55,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:38:55,477 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:38:55,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:38:55,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:38:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-11 02:38:55,529 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-11 02:38:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-11 02:38:55,529 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-11 02:38:55,529 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-11 02:38:55,529 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-11 02:38:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-11 02:38:55,530 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-11 02:38:55,530 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-11 02:38:55,531 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-11 02:38:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-11 02:38:55,531 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-11 02:38:55,531 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-11 02:38:55,531 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-11 02:38:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-11 02:38:55,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-11 02:38:55,532 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-11 02:38:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-11 02:38:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-11 02:38:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-11 02:38:55,533 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-11 02:38:55,533 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-11 02:38:55,534 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-11 02:38:55,535 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-11 02:38:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-11 02:38:55,535 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-11 02:38:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-11 02:38:55,535 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-11 02:38:55,535 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-11 02:38:55,535 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-11 02:38:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-11 02:38:55,536 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-11 02:38:55,536 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-10-11 02:38:55,536 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-10-11 02:38:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:38:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:38:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:38:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:38:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 02:38:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 02:38:55,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 02:38:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 02:38:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 02:38:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 02:38:55,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 02:38:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 02:38:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 02:38:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 02:38:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 02:38:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-11 02:38:55,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-11 02:38:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-11 02:38:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-11 02:38:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-11 02:38:55,540 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-11 02:38:55,540 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-11 02:38:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-11 02:38:55,541 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-11 02:38:55,541 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-11 02:38:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-11 02:38:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:38:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:38:55,542 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-11 02:38:55,542 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-11 02:38:55,748 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:38:55,751 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:38:56,959 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2024-10-11 02:38:56,960 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:38:57,058 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:38:57,058 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:38:57,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:38:57 BoogieIcfgContainer [2024-10-11 02:38:57,058 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:38:57,063 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:38:57,063 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:38:57,066 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:38:57,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:38:54" (1/3) ... [2024-10-11 02:38:57,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afa6ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:38:57, skipping insertion in model container [2024-10-11 02:38:57,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:38:55" (2/3) ... [2024-10-11 02:38:57,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1afa6ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:38:57, skipping insertion in model container [2024-10-11 02:38:57,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:38:57" (3/3) ... [2024-10-11 02:38:57,071 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product25.cil.c [2024-10-11 02:38:57,086 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:38:57,087 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:38:57,175 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:38:57,186 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;@5b4d760f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:38:57,187 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:38:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 511 states, 403 states have (on average 1.751861042183623) internal successors, (706), 424 states have internal predecessors, (706), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2024-10-11 02:38:57,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 02:38:57,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:38:57,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:38:57,231 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:38:57,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:38:57,239 INFO L85 PathProgramCache]: Analyzing trace with hash 796775558, now seen corresponding path program 1 times [2024-10-11 02:38:57,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:38:57,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123640421] [2024-10-11 02:38:57,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:38:57,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:38:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:58,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:38:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:58,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:58,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:58,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 02:38:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:38:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:58,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:58,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:38:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:58,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:38:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:58,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:38:58,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:58,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:38:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:38:58,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:38:58,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:38:58,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123640421] [2024-10-11 02:38:58,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123640421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:38:58,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:38:58,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:38:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070193002] [2024-10-11 02:38:58,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:38:58,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:38:58,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:38:58,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:38:58,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:38:58,684 INFO L87 Difference]: Start difference. First operand has 511 states, 403 states have (on average 1.751861042183623) internal successors, (706), 424 states have internal predecessors, (706), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:03,986 INFO L93 Difference]: Finished difference Result 1232 states and 2142 transitions. [2024-10-11 02:39:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:39:03,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2024-10-11 02:39:03,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:04,008 INFO L225 Difference]: With dead ends: 1232 [2024-10-11 02:39:04,009 INFO L226 Difference]: Without dead ends: 730 [2024-10-11 02:39:04,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:04,022 INFO L432 NwaCegarLoop]: 399 mSDtfsCounter, 1776 mSDsluCounter, 1030 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 3131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 2684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:04,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 1429 Invalid, 3131 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [447 Valid, 2684 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-11 02:39:04,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-11 02:39:04,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 507. [2024-10-11 02:39:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 401 states have (on average 1.740648379052369) internal successors, (698), 420 states have internal predecessors, (698), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 02:39:04,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 863 transitions. [2024-10-11 02:39:04,229 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 863 transitions. Word has length 67 [2024-10-11 02:39:04,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:04,230 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 863 transitions. [2024-10-11 02:39:04,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 863 transitions. [2024-10-11 02:39:04,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 02:39:04,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:04,235 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:04,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:39:04,236 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:04,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:04,237 INFO L85 PathProgramCache]: Analyzing trace with hash 433646512, now seen corresponding path program 1 times [2024-10-11 02:39:04,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:04,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791157628] [2024-10-11 02:39:04,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:04,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:04,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:04,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:04,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:39:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:39:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:04,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:04,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:04,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:39:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:04,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:39:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:04,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:39:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:04,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:04,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791157628] [2024-10-11 02:39:04,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791157628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:04,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:04,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:39:04,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344424835] [2024-10-11 02:39:04,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:04,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:39:04,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:04,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:39:04,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:39:04,944 INFO L87 Difference]: Start difference. First operand 507 states and 863 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:09,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:09,314 INFO L93 Difference]: Finished difference Result 1225 states and 2111 transitions. [2024-10-11 02:39:09,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:39:09,315 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 69 [2024-10-11 02:39:09,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:09,323 INFO L225 Difference]: With dead ends: 1225 [2024-10-11 02:39:09,323 INFO L226 Difference]: Without dead ends: 730 [2024-10-11 02:39:09,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:09,329 INFO L432 NwaCegarLoop]: 388 mSDtfsCounter, 1357 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 3053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:09,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 1437 Invalid, 3053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 02:39:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-11 02:39:09,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 507. [2024-10-11 02:39:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 401 states have (on average 1.7381546134663342) internal successors, (697), 420 states have internal predecessors, (697), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 02:39:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 862 transitions. [2024-10-11 02:39:09,458 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 862 transitions. Word has length 69 [2024-10-11 02:39:09,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:09,459 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 862 transitions. [2024-10-11 02:39:09,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:09,460 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 862 transitions. [2024-10-11 02:39:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 02:39:09,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:09,465 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:09,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:39:09,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:09,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:09,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1159329210, now seen corresponding path program 1 times [2024-10-11 02:39:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:09,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433546295] [2024-10-11 02:39:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:09,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:09,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:09,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:09,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 02:39:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:39:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:39:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:39:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:39:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:10,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:10,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433546295] [2024-10-11 02:39:10,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433546295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:10,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:10,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:39:10,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932479522] [2024-10-11 02:39:10,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:10,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:39:10,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:10,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:39:10,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:39:10,112 INFO L87 Difference]: Start difference. First operand 507 states and 862 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:14,558 INFO L93 Difference]: Finished difference Result 1225 states and 2110 transitions. [2024-10-11 02:39:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:39:14,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 70 [2024-10-11 02:39:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:14,565 INFO L225 Difference]: With dead ends: 1225 [2024-10-11 02:39:14,566 INFO L226 Difference]: Without dead ends: 730 [2024-10-11 02:39:14,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:14,571 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 920 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 2901 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 3099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 2901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:14,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 1492 Invalid, 3099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 2901 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 02:39:14,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-11 02:39:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 507. [2024-10-11 02:39:14,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 401 states have (on average 1.7356608478802993) internal successors, (696), 420 states have internal predecessors, (696), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 02:39:14,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 861 transitions. [2024-10-11 02:39:14,698 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 861 transitions. Word has length 70 [2024-10-11 02:39:14,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:14,698 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 861 transitions. [2024-10-11 02:39:14,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:14,699 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 861 transitions. [2024-10-11 02:39:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-11 02:39:14,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:14,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:14,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 02:39:14,706 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:14,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash -755766420, now seen corresponding path program 1 times [2024-10-11 02:39:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:14,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834892704] [2024-10-11 02:39:14,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 02:39:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:15,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:39:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:15,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:15,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:15,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:39:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:15,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:39:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:15,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:39:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:15,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:15,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834892704] [2024-10-11 02:39:15,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834892704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:15,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:15,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:39:15,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567610924] [2024-10-11 02:39:15,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:15,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:39:15,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:15,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:39:15,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:39:15,343 INFO L87 Difference]: Start difference. First operand 507 states and 861 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:19,333 INFO L93 Difference]: Finished difference Result 1225 states and 2109 transitions. [2024-10-11 02:39:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:39:19,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 71 [2024-10-11 02:39:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:19,339 INFO L225 Difference]: With dead ends: 1225 [2024-10-11 02:39:19,339 INFO L226 Difference]: Without dead ends: 730 [2024-10-11 02:39:19,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:19,343 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 1776 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 2647 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1840 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 3106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 2647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:19,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1840 Valid, 1403 Invalid, 3106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 2647 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-11 02:39:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-11 02:39:19,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 507. [2024-10-11 02:39:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 401 states have (on average 1.7331670822942644) internal successors, (695), 420 states have internal predecessors, (695), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 02:39:19,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 860 transitions. [2024-10-11 02:39:19,449 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 860 transitions. Word has length 71 [2024-10-11 02:39:19,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:19,450 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 860 transitions. [2024-10-11 02:39:19,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 860 transitions. [2024-10-11 02:39:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-11 02:39:19,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:19,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:19,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 02:39:19,453 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:19,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1364355702, now seen corresponding path program 1 times [2024-10-11 02:39:19,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:19,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622056906] [2024-10-11 02:39:19,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:19,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:19,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:19,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:39:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 02:39:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:39:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:39:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:39:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622056906] [2024-10-11 02:39:20,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622056906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:20,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:39:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310085611] [2024-10-11 02:39:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:20,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:39:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:20,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:39:20,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:39:20,151 INFO L87 Difference]: Start difference. First operand 507 states and 860 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:24,534 INFO L93 Difference]: Finished difference Result 1225 states and 2108 transitions. [2024-10-11 02:39:24,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:39:24,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 72 [2024-10-11 02:39:24,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:24,540 INFO L225 Difference]: With dead ends: 1225 [2024-10-11 02:39:24,540 INFO L226 Difference]: Without dead ends: 730 [2024-10-11 02:39:24,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:24,544 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 918 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 2895 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 1486 SdHoareTripleChecker+Invalid, 3092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 2895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:24,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 1486 Invalid, 3092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 2895 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-11 02:39:24,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-11 02:39:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 507. [2024-10-11 02:39:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 401 states have (on average 1.7306733167082293) internal successors, (694), 420 states have internal predecessors, (694), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 02:39:24,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 859 transitions. [2024-10-11 02:39:24,664 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 859 transitions. Word has length 72 [2024-10-11 02:39:24,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:24,666 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 859 transitions. [2024-10-11 02:39:24,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:24,666 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 859 transitions. [2024-10-11 02:39:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 02:39:24,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:24,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:24,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 02:39:24,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:24,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:24,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2080638265, now seen corresponding path program 1 times [2024-10-11 02:39:24,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:24,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143630360] [2024-10-11 02:39:24,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:24,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:24,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:24,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:24,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:25,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 02:39:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:25,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:25,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:25,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:25,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 02:39:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:25,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 02:39:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:25,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:39:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:25,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:25,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143630360] [2024-10-11 02:39:25,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143630360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:25,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:25,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:39:25,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713795145] [2024-10-11 02:39:25,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:25,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:39:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:25,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:39:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:39:25,323 INFO L87 Difference]: Start difference. First operand 507 states and 859 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:30,138 INFO L93 Difference]: Finished difference Result 1197 states and 2056 transitions. [2024-10-11 02:39:30,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:39:30,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 73 [2024-10-11 02:39:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:30,144 INFO L225 Difference]: With dead ends: 1197 [2024-10-11 02:39:30,144 INFO L226 Difference]: Without dead ends: 742 [2024-10-11 02:39:30,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:39:30,148 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 1843 mSDsluCounter, 1766 mSDsCounter, 0 mSdLazyCounter, 4186 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1907 SdHoareTripleChecker+Valid, 2158 SdHoareTripleChecker+Invalid, 4646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 4186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:30,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1907 Valid, 2158 Invalid, 4646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 4186 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-11 02:39:30,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2024-10-11 02:39:30,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 509. [2024-10-11 02:39:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 403 states have (on average 1.7146401985111663) internal successors, (691), 422 states have internal predecessors, (691), 85 states have call successors, (85), 21 states have call predecessors, (85), 20 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2024-10-11 02:39:30,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 856 transitions. [2024-10-11 02:39:30,260 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 856 transitions. Word has length 73 [2024-10-11 02:39:30,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:30,261 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 856 transitions. [2024-10-11 02:39:30,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (10), 5 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:30,261 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 856 transitions. [2024-10-11 02:39:30,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 02:39:30,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:30,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:30,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:39:30,267 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:30,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:30,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1790137066, now seen corresponding path program 1 times [2024-10-11 02:39:30,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:30,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251846927] [2024-10-11 02:39:30,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:30,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:39:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:39:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:39:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 02:39:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:30,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:30,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:30,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251846927] [2024-10-11 02:39:30,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251846927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:30,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:30,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:39:30,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180950509] [2024-10-11 02:39:30,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:30,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:39:30,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:30,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:39:30,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:39:30,973 INFO L87 Difference]: Start difference. First operand 509 states and 856 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:37,004 INFO L93 Difference]: Finished difference Result 1205 states and 2063 transitions. [2024-10-11 02:39:37,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:39:37,005 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 77 [2024-10-11 02:39:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:37,009 INFO L225 Difference]: With dead ends: 1205 [2024-10-11 02:39:37,009 INFO L226 Difference]: Without dead ends: 748 [2024-10-11 02:39:37,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2024-10-11 02:39:37,015 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 990 mSDsluCounter, 2235 mSDsCounter, 0 mSdLazyCounter, 5140 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1056 SdHoareTripleChecker+Valid, 2625 SdHoareTripleChecker+Invalid, 5354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 5140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:37,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1056 Valid, 2625 Invalid, 5354 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [214 Valid, 5140 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 02:39:37,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2024-10-11 02:39:37,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 513. [2024-10-11 02:39:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 513 states, 406 states have (on average 1.6970443349753694) internal successors, (689), 425 states have internal predecessors, (689), 85 states have call successors, (85), 21 states have call predecessors, (85), 21 states have return successors, (82), 79 states have call predecessors, (82), 80 states have call successors, (82) [2024-10-11 02:39:37,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 856 transitions. [2024-10-11 02:39:37,143 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 856 transitions. Word has length 77 [2024-10-11 02:39:37,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:37,143 INFO L471 AbstractCegarLoop]: Abstraction has 513 states and 856 transitions. [2024-10-11 02:39:37,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 02:39:37,144 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 856 transitions. [2024-10-11 02:39:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 02:39:37,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:37,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:37,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:39:37,147 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:37,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash 922281186, now seen corresponding path program 1 times [2024-10-11 02:39:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:37,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396227223] [2024-10-11 02:39:37,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:37,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:39:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:39:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:39:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:39:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:37,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:37,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396227223] [2024-10-11 02:39:37,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396227223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:37,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:37,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:39:37,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863132324] [2024-10-11 02:39:37,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:37,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:39:37,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:37,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:39:37,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:39:37,758 INFO L87 Difference]: Start difference. First operand 513 states and 856 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:39:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:39:49,368 INFO L93 Difference]: Finished difference Result 2311 states and 4112 transitions. [2024-10-11 02:39:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-11 02:39:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 82 [2024-10-11 02:39:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:39:49,386 INFO L225 Difference]: With dead ends: 2311 [2024-10-11 02:39:49,386 INFO L226 Difference]: Without dead ends: 1850 [2024-10-11 02:39:49,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=258, Invalid=734, Unknown=0, NotChecked=0, Total=992 [2024-10-11 02:39:49,392 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 3664 mSDsluCounter, 2992 mSDsCounter, 0 mSdLazyCounter, 6481 mSolverCounterSat, 1096 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3734 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 7577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1096 IncrementalHoareTripleChecker+Valid, 6481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:39:49,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3734 Valid, 3483 Invalid, 7577 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1096 Valid, 6481 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2024-10-11 02:39:49,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2024-10-11 02:39:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1332. [2024-10-11 02:39:49,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1048 states have (on average 1.6717557251908397) internal successors, (1752), 1095 states have internal predecessors, (1752), 224 states have call successors, (224), 56 states have call predecessors, (224), 59 states have return successors, (258), 216 states have call predecessors, (258), 219 states have call successors, (258) [2024-10-11 02:39:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2234 transitions. [2024-10-11 02:39:49,730 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2234 transitions. Word has length 82 [2024-10-11 02:39:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:39:49,731 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 2234 transitions. [2024-10-11 02:39:49,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 02:39:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2234 transitions. [2024-10-11 02:39:49,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 02:39:49,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:39:49,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:39:49,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:39:49,734 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:39:49,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:39:49,735 INFO L85 PathProgramCache]: Analyzing trace with hash 660039984, now seen corresponding path program 1 times [2024-10-11 02:39:49,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:39:49,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288652560] [2024-10-11 02:39:49,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:39:49,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:39:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:39:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:50,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:39:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:50,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:50,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:39:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:39:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:50,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:39:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:50,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:39:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:50,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:39:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:39:50,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 02:39:50,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:39:50,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288652560] [2024-10-11 02:39:50,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288652560] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:39:50,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:39:50,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 02:39:50,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043058750] [2024-10-11 02:39:50,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:39:50,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:39:50,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:39:50,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:39:50,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:39:50,552 INFO L87 Difference]: Start difference. First operand 1332 states and 2234 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 02:40:01,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:01,622 INFO L93 Difference]: Finished difference Result 3405 states and 5929 transitions. [2024-10-11 02:40:01,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-11 02:40:01,623 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 90 [2024-10-11 02:40:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:01,639 INFO L225 Difference]: With dead ends: 3405 [2024-10-11 02:40:01,639 INFO L226 Difference]: Without dead ends: 1939 [2024-10-11 02:40:01,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=242, Invalid=948, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 02:40:01,648 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 3232 mSDsluCounter, 3368 mSDsCounter, 0 mSdLazyCounter, 7305 mSolverCounterSat, 740 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3291 SdHoareTripleChecker+Valid, 3772 SdHoareTripleChecker+Invalid, 8045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 740 IncrementalHoareTripleChecker+Valid, 7305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:01,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3291 Valid, 3772 Invalid, 8045 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [740 Valid, 7305 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2024-10-11 02:40:01,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2024-10-11 02:40:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1412. [2024-10-11 02:40:02,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1109 states have (on average 1.6393146979260595) internal successors, (1818), 1160 states have internal predecessors, (1818), 236 states have call successors, (236), 61 states have call predecessors, (236), 66 states have return successors, (282), 226 states have call predecessors, (282), 231 states have call successors, (282) [2024-10-11 02:40:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 2336 transitions. [2024-10-11 02:40:02,026 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 2336 transitions. Word has length 90 [2024-10-11 02:40:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:02,027 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 2336 transitions. [2024-10-11 02:40:02,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-10-11 02:40:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 2336 transitions. [2024-10-11 02:40:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:40:02,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:02,030 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:02,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:40:02,030 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:02,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:02,031 INFO L85 PathProgramCache]: Analyzing trace with hash 281293911, now seen corresponding path program 1 times [2024-10-11 02:40:02,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:02,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32952981] [2024-10-11 02:40:02,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:02,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:40:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:40:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:40:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:40:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:40:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 02:40:02,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:02,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32952981] [2024-10-11 02:40:02,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32952981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:02,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:02,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:40:02,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298439693] [2024-10-11 02:40:02,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:02,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:40:02,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:02,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:40:02,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:40:02,757 INFO L87 Difference]: Start difference. First operand 1412 states and 2336 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:40:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:40:09,832 INFO L93 Difference]: Finished difference Result 3383 states and 5860 transitions. [2024-10-11 02:40:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 02:40:09,833 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 93 [2024-10-11 02:40:09,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:40:09,851 INFO L225 Difference]: With dead ends: 3383 [2024-10-11 02:40:09,852 INFO L226 Difference]: Without dead ends: 2023 [2024-10-11 02:40:09,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2024-10-11 02:40:09,885 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1062 mSDsluCounter, 3231 mSDsCounter, 0 mSdLazyCounter, 6532 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 3655 SdHoareTripleChecker+Invalid, 6773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 6532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:40:09,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 3655 Invalid, 6773 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [241 Valid, 6532 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 02:40:09,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2024-10-11 02:40:10,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1434. [2024-10-11 02:40:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1120 states have (on average 1.6285714285714286) internal successors, (1824), 1178 states have internal predecessors, (1824), 240 states have call successors, (240), 61 states have call predecessors, (240), 73 states have return successors, (313), 230 states have call predecessors, (313), 235 states have call successors, (313) [2024-10-11 02:40:10,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 2377 transitions. [2024-10-11 02:40:10,262 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 2377 transitions. Word has length 93 [2024-10-11 02:40:10,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:40:10,263 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 2377 transitions. [2024-10-11 02:40:10,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:40:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 2377 transitions. [2024-10-11 02:40:10,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:40:10,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:40:10,267 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:40:10,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:40:10,268 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:40:10,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:40:10,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1182368055, now seen corresponding path program 1 times [2024-10-11 02:40:10,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:40:10,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274778651] [2024-10-11 02:40:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:40:10,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:40:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:40:10,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 02:40:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 02:40:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:10,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:11,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:40:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:11,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:40:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:11,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-11 02:40:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:11,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:40:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:40:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:11,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 02:40:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:40:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-10-11 02:40:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:40:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274778651] [2024-10-11 02:40:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274778651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:40:11,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:40:11,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 02:40:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710124910] [2024-10-11 02:40:11,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:40:11,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:40:11,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:40:11,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:40:11,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:40:11,029 INFO L87 Difference]: Start difference. First operand 1434 states and 2377 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)