./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_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:46:51,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:46:51,326 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:46:51,335 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:46:51,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:46:51,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:46:51,370 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:46:51,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:46:51,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:46:51,374 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:46:51,374 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:46:51,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:46:51,375 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:46:51,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:46:51,375 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:46:51,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:46:51,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:46:51,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:46:51,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:46:51,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:46:51,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:46:51,381 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:46:51,382 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:46:51,382 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:46:51,382 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:46:51,382 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:46:51,382 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:46:51,383 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:46:51,383 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:46:51,383 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:46:51,383 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:46:51,383 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:46:51,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:46:51,384 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:46:51,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:46:51,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:46:51,387 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:46:51,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:46:51,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:46:51,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:46:51,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:46:51,388 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:46:51,388 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bf5a3f22f9d7a0aaa2c9864b464fdc1b701547a697c01ddf6ee0cf69e3554ef9 [2024-11-19 21:46:51,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:46:51,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:46:51,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:46:51,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:46:51,689 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:46:51,690 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2024-11-19 21:46:53,131 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:46:53,432 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:46:53,433 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c [2024-11-19 21:46:53,457 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f6e5e50/d4bc6b13d26b4aa4b1a8c33057bd7f16/FLAGb0057145a [2024-11-19 21:46:53,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52f6e5e50/d4bc6b13d26b4aa4b1a8c33057bd7f16 [2024-11-19 21:46:53,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:46:53,478 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:46:53,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:46:53,482 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:46:53,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:46:53,487 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:46:53" (1/1) ... [2024-11-19 21:46:53,488 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e5dbf5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:53, skipping insertion in model container [2024-11-19 21:46:53,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:46:53" (1/1) ... [2024-11-19 21:46:53,561 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:46:53,777 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c[1700,1713] [2024-11-19 21:46:54,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:46:54,215 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:46:54,225 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-11-19 21:46:54,226 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [62] [2024-11-19 21:46:54,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [71] [2024-11-19 21:46:54,227 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [235] [2024-11-19 21:46:54,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [903] [2024-11-19 21:46:54,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1263] [2024-11-19 21:46:54,228 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1355] [2024-11-19 21:46:54,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1390] [2024-11-19 21:46:54,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1756] [2024-11-19 21:46:54,229 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [3289] [2024-11-19 21:46:54,233 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product29.cil.c[1700,1713] [2024-11-19 21:46:54,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:46:54,392 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:46:54,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54 WrapperNode [2024-11-19 21:46:54,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:46:54,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:46:54,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:46:54,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:46:54,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,423 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,476 INFO L138 Inliner]: procedures = 93, calls = 338, calls flagged for inlining = 27, calls inlined = 24, statements flattened = 863 [2024-11-19 21:46:54,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:46:54,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:46:54,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:46:54,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:46:54,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,534 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-11-19 21:46:54,535 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,535 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,588 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:46:54,621 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:46:54,621 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:46:54,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:46:54,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (1/1) ... [2024-11-19 21:46:54,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:46:54,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:46:54,665 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 21:46:54,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 21:46:54,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:46:54,719 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-19 21:46:54,719 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-19 21:46:54,720 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-11-19 21:46:54,720 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-11-19 21:46:54,720 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-19 21:46:54,720 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-19 21:46:54,720 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-19 21:46:54,721 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-19 21:46:54,721 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-19 21:46:54,721 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-19 21:46:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-11-19 21:46:54,722 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-11-19 21:46:54,722 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-19 21:46:54,722 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-19 21:46:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-19 21:46:54,723 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-19 21:46:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-19 21:46:54,723 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-19 21:46:54,723 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-19 21:46:54,724 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-19 21:46:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-19 21:46:54,724 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-19 21:46:54,724 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-19 21:46:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-19 21:46:54,725 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-19 21:46:54,725 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-19 21:46:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-19 21:46:54,726 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-19 21:46:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-19 21:46:54,726 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-19 21:46:54,726 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-19 21:46:54,726 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-19 21:46:54,727 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-19 21:46:54,727 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-19 21:46:54,766 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-19 21:46:54,767 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-19 21:46:54,767 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-11-19 21:46:54,767 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-11-19 21:46:54,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:46:54,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:46:54,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:46:54,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:46:54,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 21:46:54,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 21:46:54,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-19 21:46:54,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-19 21:46:54,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-19 21:46:54,769 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-11-19 21:46:54,769 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-11-19 21:46:54,769 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-19 21:46:54,769 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-19 21:46:54,769 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-19 21:46:54,769 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-19 21:46:54,769 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-19 21:46:54,769 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-19 21:46:54,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:46:54,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:46:54,769 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-19 21:46:54,769 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-19 21:46:54,948 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:46:54,950 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:46:56,114 INFO L? ?]: Removed 454 outVars from TransFormulas that were not future-live. [2024-11-19 21:46:56,114 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:46:56,144 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:46:56,148 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:46:56,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:46:56 BoogieIcfgContainer [2024-11-19 21:46:56,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:46:56,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:46:56,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:46:56,156 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:46:56,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:46:53" (1/3) ... [2024-11-19 21:46:56,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ab64c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:46:56, skipping insertion in model container [2024-11-19 21:46:56,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:46:54" (2/3) ... [2024-11-19 21:46:56,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ab64c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:46:56, skipping insertion in model container [2024-11-19 21:46:56,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:46:56" (3/3) ... [2024-11-19 21:46:56,160 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2024-11-19 21:46:56,177 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:46:56,177 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:46:56,261 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:46:56,268 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;@19d8d2bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:46:56,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:46:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand has 563 states, 445 states have (on average 1.698876404494382) internal successors, (756), 466 states have internal predecessors, (756), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-19 21:46:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 21:46:56,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:46:56,304 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-11-19 21:46:56,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:46:56,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:46:56,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1610874664, now seen corresponding path program 1 times [2024-11-19 21:46:56,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:46:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258131420] [2024-11-19 21:46:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:46:56,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:46:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:46:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:46:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-19 21:46:57,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:46:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:46:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-19 21:46:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 21:46:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 21:46:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:46:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-19 21:46:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:46:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:46:57,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:46:57,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258131420] [2024-11-19 21:46:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258131420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:46:57,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:46:57,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 21:46:57,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282988708] [2024-11-19 21:46:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:46:57,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:46:57,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:46:57,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:46:57,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:46:57,988 INFO L87 Difference]: Start difference. First operand has 563 states, 445 states have (on average 1.698876404494382) internal successors, (756), 466 states have internal predecessors, (756), 92 states have call successors, (92), 24 states have call predecessors, (92), 24 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:47:05,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:05,637 INFO L93 Difference]: Finished difference Result 1350 states and 2292 transitions. [2024-11-19 21:47:05,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:47:05,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2024-11-19 21:47:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:05,672 INFO L225 Difference]: With dead ends: 1350 [2024-11-19 21:47:05,673 INFO L226 Difference]: Without dead ends: 799 [2024-11-19 21:47:05,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-19 21:47:05,695 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1435 mSDsluCounter, 2558 mSDsCounter, 0 mSdLazyCounter, 5348 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 3010 SdHoareTripleChecker+Invalid, 5686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 5348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:05,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 3010 Invalid, 5686 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [338 Valid, 5348 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-19 21:47:05,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2024-11-19 21:47:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 558. [2024-11-19 21:47:05,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 442 states have (on average 1.6900452488687783) internal successors, (747), 461 states have internal predecessors, (747), 92 states have call successors, (92), 24 states have call predecessors, (92), 23 states have return successors, (87), 85 states have call predecessors, (87), 87 states have call successors, (87) [2024-11-19 21:47:05,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 926 transitions. [2024-11-19 21:47:05,976 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 926 transitions. Word has length 90 [2024-11-19 21:47:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:05,977 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 926 transitions. [2024-11-19 21:47:05,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:47:05,978 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 926 transitions. [2024-11-19 21:47:05,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 21:47:05,987 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:05,987 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:05,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 21:47:05,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:05,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:05,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1078497272, now seen corresponding path program 1 times [2024-11-19 21:47:05,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:05,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80615140] [2024-11-19 21:47:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:05,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:06,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:06,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:06,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:06,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:06,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-19 21:47:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:06,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:06,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:47:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:47:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:06,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:47:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 21:47:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:07,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:47:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:07,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:47:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:07,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:47:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:07,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:07,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:07,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80615140] [2024-11-19 21:47:07,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80615140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:07,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:07,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 21:47:07,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105886265] [2024-11-19 21:47:07,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:07,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 21:47:07,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:07,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 21:47:07,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:47:07,031 INFO L87 Difference]: Start difference. First operand 558 states and 926 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:15,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:15,844 INFO L93 Difference]: Finished difference Result 1348 states and 2273 transitions. [2024-11-19 21:47:15,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 21:47:15,845 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2024-11-19 21:47:15,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:15,854 INFO L225 Difference]: With dead ends: 1348 [2024-11-19 21:47:15,854 INFO L226 Difference]: Without dead ends: 808 [2024-11-19 21:47:15,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2024-11-19 21:47:15,860 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 994 mSDsluCounter, 3859 mSDsCounter, 0 mSdLazyCounter, 7875 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 4304 SdHoareTripleChecker+Invalid, 8081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 7875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:15,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 4304 Invalid, 8081 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [206 Valid, 7875 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-19 21:47:15,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-19 21:47:15,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 565. [2024-11-19 21:47:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 447 states have (on average 1.680089485458613) internal successors, (751), 466 states have internal predecessors, (751), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 87 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-19 21:47:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 935 transitions. [2024-11-19 21:47:16,005 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 935 transitions. Word has length 96 [2024-11-19 21:47:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:16,006 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 935 transitions. [2024-11-19 21:47:16,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 8 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 935 transitions. [2024-11-19 21:47:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 21:47:16,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:16,010 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:16,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 21:47:16,011 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:16,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:16,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1811433455, now seen corresponding path program 1 times [2024-11-19 21:47:16,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:16,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060121237] [2024-11-19 21:47:16,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:16,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-19 21:47:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:16,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:47:16,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:47:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:47:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 21:47:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:47:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 21:47:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-19 21:47:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:16,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:16,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060121237] [2024-11-19 21:47:16,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060121237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:16,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:16,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:47:16,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770808439] [2024-11-19 21:47:16,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:16,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:47:16,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:16,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:47:16,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:16,673 INFO L87 Difference]: Start difference. First operand 565 states and 935 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:20,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:20,854 INFO L93 Difference]: Finished difference Result 1355 states and 2274 transitions. [2024-11-19 21:47:20,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:47:20,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-11-19 21:47:20,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:20,861 INFO L225 Difference]: With dead ends: 1355 [2024-11-19 21:47:20,861 INFO L226 Difference]: Without dead ends: 808 [2024-11-19 21:47:20,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:47:20,866 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 1883 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 2750 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1955 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 2750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:20,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1955 Valid, 1614 Invalid, 3226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 2750 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-19 21:47:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-19 21:47:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 565. [2024-11-19 21:47:20,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 447 states have (on average 1.6778523489932886) internal successors, (750), 466 states have internal predecessors, (750), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 87 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-19 21:47:20,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 934 transitions. [2024-11-19 21:47:21,000 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 934 transitions. Word has length 98 [2024-11-19 21:47:21,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:21,000 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 934 transitions. [2024-11-19 21:47:21,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 934 transitions. [2024-11-19 21:47:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 21:47:21,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:21,004 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:21,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 21:47:21,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:21,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:21,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1526586216, now seen corresponding path program 1 times [2024-11-19 21:47:21,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:21,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395006351] [2024-11-19 21:47:21,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:21,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-19 21:47:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:47:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:47:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:47:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:47:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 21:47:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:47:21,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 21:47:21,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-19 21:47:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:21,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:21,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:21,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395006351] [2024-11-19 21:47:21,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395006351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:21,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:21,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:47:21,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281295181] [2024-11-19 21:47:21,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:21,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:47:21,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:21,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:47:21,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:21,641 INFO L87 Difference]: Start difference. First operand 565 states and 934 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:25,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:25,619 INFO L93 Difference]: Finished difference Result 1355 states and 2273 transitions. [2024-11-19 21:47:25,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:47:25,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-11-19 21:47:25,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:25,625 INFO L225 Difference]: With dead ends: 1355 [2024-11-19 21:47:25,626 INFO L226 Difference]: Without dead ends: 808 [2024-11-19 21:47:25,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:47:25,632 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 1435 mSDsluCounter, 1209 mSDsCounter, 0 mSdLazyCounter, 2778 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 3124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 2778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:25,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1651 Invalid, 3124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 2778 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 21:47:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-19 21:47:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 565. [2024-11-19 21:47:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 447 states have (on average 1.6756152125279642) internal successors, (749), 466 states have internal predecessors, (749), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 87 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-19 21:47:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 933 transitions. [2024-11-19 21:47:25,745 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 933 transitions. Word has length 99 [2024-11-19 21:47:25,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:25,746 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 933 transitions. [2024-11-19 21:47:25,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 933 transitions. [2024-11-19 21:47:25,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 21:47:25,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:25,749 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:25,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 21:47:25,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:25,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:25,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1389275509, now seen corresponding path program 1 times [2024-11-19 21:47:25,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:25,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301379524] [2024-11-19 21:47:25,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:25,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:25,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:25,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:25,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:26,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 21:47:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:26,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:47:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:26,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:47:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:26,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:47:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:26,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:47:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:26,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 21:47:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:26,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:47:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:26,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 21:47:26,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:26,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-19 21:47:26,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:26,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:26,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301379524] [2024-11-19 21:47:26,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301379524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:26,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:26,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:47:26,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347455626] [2024-11-19 21:47:26,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:26,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:47:26,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:26,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:47:26,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:26,428 INFO L87 Difference]: Start difference. First operand 565 states and 933 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:30,297 INFO L93 Difference]: Finished difference Result 1355 states and 2272 transitions. [2024-11-19 21:47:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 21:47:30,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-19 21:47:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:30,304 INFO L225 Difference]: With dead ends: 1355 [2024-11-19 21:47:30,304 INFO L226 Difference]: Without dead ends: 808 [2024-11-19 21:47:30,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:47:30,308 INFO L432 NwaCegarLoop]: 442 mSDtfsCounter, 1881 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 2745 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1953 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 2745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:30,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1953 Valid, 1603 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 2745 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 21:47:30,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2024-11-19 21:47:30,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 565. [2024-11-19 21:47:30,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 447 states have (on average 1.6733780760626398) internal successors, (748), 466 states have internal predecessors, (748), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 87 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-19 21:47:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 932 transitions. [2024-11-19 21:47:30,422 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 932 transitions. Word has length 100 [2024-11-19 21:47:30,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:30,422 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 932 transitions. [2024-11-19 21:47:30,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 932 transitions. [2024-11-19 21:47:30,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 21:47:30,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:30,425 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:30,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 21:47:30,426 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:30,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:30,426 INFO L85 PathProgramCache]: Analyzing trace with hash -890905484, now seen corresponding path program 1 times [2024-11-19 21:47:30,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:30,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382020223] [2024-11-19 21:47:30,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:30,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:30,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:30,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:30,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:47:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:31,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:31,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:47:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:31,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:47:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:31,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:47:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:31,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 21:47:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:31,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:47:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:31,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 21:47:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:31,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-19 21:47:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:31,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:31,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:31,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382020223] [2024-11-19 21:47:31,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382020223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:31,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:31,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:47:31,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280493968] [2024-11-19 21:47:31,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:31,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:47:31,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:31,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:47:31,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:47:31,243 INFO L87 Difference]: Start difference. First operand 565 states and 932 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:38,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:38,076 INFO L93 Difference]: Finished difference Result 1334 states and 2231 transitions. [2024-11-19 21:47:38,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 21:47:38,076 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2024-11-19 21:47:38,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:38,081 INFO L225 Difference]: With dead ends: 1334 [2024-11-19 21:47:38,081 INFO L226 Difference]: Without dead ends: 827 [2024-11-19 21:47:38,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:47:38,085 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 1046 mSDsluCounter, 3428 mSDsCounter, 0 mSdLazyCounter, 6991 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1121 SdHoareTripleChecker+Valid, 3871 SdHoareTripleChecker+Invalid, 7204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 6991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:38,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1121 Valid, 3871 Invalid, 7204 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [213 Valid, 6991 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-19 21:47:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-11-19 21:47:38,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 566. [2024-11-19 21:47:38,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 448 states have (on average 1.6607142857142858) internal successors, (744), 466 states have internal predecessors, (744), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 88 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-19 21:47:38,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 928 transitions. [2024-11-19 21:47:38,198 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 928 transitions. Word has length 101 [2024-11-19 21:47:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:38,198 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 928 transitions. [2024-11-19 21:47:38,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 7 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 928 transitions. [2024-11-19 21:47:38,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 21:47:38,202 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:38,202 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:38,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:47:38,203 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:38,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash 251640511, now seen corresponding path program 1 times [2024-11-19 21:47:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:38,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12622557] [2024-11-19 21:47:38,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:47:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:47:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:47:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:47:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 21:47:38,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-19 21:47:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-19 21:47:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-19 21:47:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:38,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:38,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12622557] [2024-11-19 21:47:38,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12622557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:38,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:38,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:47:38,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789887336] [2024-11-19 21:47:38,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:38,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:47:38,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:38,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:47:38,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:47:38,899 INFO L87 Difference]: Start difference. First operand 566 states and 928 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:43,517 INFO L93 Difference]: Finished difference Result 1339 states and 2240 transitions. [2024-11-19 21:47:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:47:43,518 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2024-11-19 21:47:43,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:43,523 INFO L225 Difference]: With dead ends: 1339 [2024-11-19 21:47:43,523 INFO L226 Difference]: Without dead ends: 831 [2024-11-19 21:47:43,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:47:43,526 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 1524 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 4308 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 2494 SdHoareTripleChecker+Invalid, 4677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 4308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:43,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 2494 Invalid, 4677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 4308 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-19 21:47:43,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-11-19 21:47:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 569. [2024-11-19 21:47:43,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 451 states have (on average 1.647450110864745) internal successors, (743), 469 states have internal predecessors, (743), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (92), 88 states have call predecessors, (92), 87 states have call successors, (92) [2024-11-19 21:47:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 927 transitions. [2024-11-19 21:47:43,627 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 927 transitions. Word has length 102 [2024-11-19 21:47:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 927 transitions. [2024-11-19 21:47:43,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 927 transitions. [2024-11-19 21:47:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 21:47:43,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:43,632 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:43,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:47:43,632 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:43,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:43,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1057939171, now seen corresponding path program 1 times [2024-11-19 21:47:43,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:43,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601502789] [2024-11-19 21:47:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:43,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:43,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:43,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:44,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:47:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:44,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:44,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:47:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:44,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:47:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:44,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:47:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:44,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 21:47:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:44,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:47:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 21:47:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:44,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-19 21:47:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:44,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:44,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601502789] [2024-11-19 21:47:44,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601502789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:44,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:44,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 21:47:44,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219648122] [2024-11-19 21:47:44,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:44,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:47:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:44,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:47:44,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:47:44,302 INFO L87 Difference]: Start difference. First operand 569 states and 927 transitions. Second operand has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 21:47:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:49,805 INFO L93 Difference]: Finished difference Result 1340 states and 2222 transitions. [2024-11-19 21:47:49,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 21:47:49,806 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-19 21:47:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:49,812 INFO L225 Difference]: With dead ends: 1340 [2024-11-19 21:47:49,812 INFO L226 Difference]: Without dead ends: 838 [2024-11-19 21:47:49,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-19 21:47:49,816 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 1956 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 5105 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2029 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 5590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 5105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:49,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2029 Valid, 2909 Invalid, 5590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 5105 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 21:47:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-19 21:47:49,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 582. [2024-11-19 21:47:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 461 states have (on average 1.6442516268980478) internal successors, (758), 481 states have internal predecessors, (758), 93 states have call successors, (93), 24 states have call predecessors, (93), 27 states have return successors, (95), 89 states have call predecessors, (95), 88 states have call successors, (95) [2024-11-19 21:47:49,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 946 transitions. [2024-11-19 21:47:49,939 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 946 transitions. Word has length 106 [2024-11-19 21:47:49,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:49,940 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 946 transitions. [2024-11-19 21:47:49,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.777777777777779) internal successors, (79), 6 states have internal predecessors, (79), 3 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 21:47:49,940 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 946 transitions. [2024-11-19 21:47:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 21:47:49,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:49,944 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:49,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:47:49,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:49,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash 672572388, now seen corresponding path program 1 times [2024-11-19 21:47:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:49,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438841859] [2024-11-19 21:47:49,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:49,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:47:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:47:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:47:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:47:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 21:47:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:47:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-19 21:47:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-19 21:47:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:50,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 21:47:50,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:50,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438841859] [2024-11-19 21:47:50,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438841859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:47:50,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117817048] [2024-11-19 21:47:50,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:50,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:47:50,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:47:50,721 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:47:50,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 21:47:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:51,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 21:47:51,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:47:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 21:47:51,059 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:47:51,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117817048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:51,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:47:51,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 14 [2024-11-19 21:47:51,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266544528] [2024-11-19 21:47:51,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:51,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:47:51,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:51,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:47:51,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:47:51,062 INFO L87 Difference]: Start difference. First operand 582 states and 946 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:51,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:51,353 INFO L93 Difference]: Finished difference Result 1534 states and 2557 transitions. [2024-11-19 21:47:51,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:47:51,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2024-11-19 21:47:51,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:51,362 INFO L225 Difference]: With dead ends: 1534 [2024-11-19 21:47:51,362 INFO L226 Difference]: Without dead ends: 1037 [2024-11-19 21:47:51,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:47:51,366 INFO L432 NwaCegarLoop]: 976 mSDtfsCounter, 840 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:51,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [840 Valid, 1696 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 21:47:51,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2024-11-19 21:47:51,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1022. [2024-11-19 21:47:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1022 states, 805 states have (on average 1.631055900621118) internal successors, (1313), 838 states have internal predecessors, (1313), 168 states have call successors, (168), 43 states have call predecessors, (168), 48 states have return successors, (194), 166 states have call predecessors, (194), 163 states have call successors, (194) [2024-11-19 21:47:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1022 states to 1022 states and 1675 transitions. [2024-11-19 21:47:51,572 INFO L78 Accepts]: Start accepts. Automaton has 1022 states and 1675 transitions. Word has length 106 [2024-11-19 21:47:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:51,572 INFO L471 AbstractCegarLoop]: Abstraction has 1022 states and 1675 transitions. [2024-11-19 21:47:51,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:51,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1022 states and 1675 transitions. [2024-11-19 21:47:51,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 21:47:51,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:51,576 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:51,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 21:47:51,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:47:51,777 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:51,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:51,777 INFO L85 PathProgramCache]: Analyzing trace with hash -167015540, now seen corresponding path program 1 times [2024-11-19 21:47:51,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:51,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349230220] [2024-11-19 21:47:51,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:51,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:51,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:52,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:52,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 21:47:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:52,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:52,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:47:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:52,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:47:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:47:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:52,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:52,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:47:52,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:52,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:47:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:52,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-19 21:47:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:52,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:52,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:52,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349230220] [2024-11-19 21:47:52,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349230220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:52,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:52,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:47:52,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88855471] [2024-11-19 21:47:52,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:52,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:47:52,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:52,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:47:52,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:47:52,402 INFO L87 Difference]: Start difference. First operand 1022 states and 1675 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:56,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:47:56,275 INFO L93 Difference]: Finished difference Result 2406 states and 4028 transitions. [2024-11-19 21:47:56,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:47:56,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-11-19 21:47:56,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:47:56,286 INFO L225 Difference]: With dead ends: 2406 [2024-11-19 21:47:56,287 INFO L226 Difference]: Without dead ends: 1446 [2024-11-19 21:47:56,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:47:56,292 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 1953 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 2667 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2025 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 2667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:47:56,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2025 Valid, 1592 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 2667 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-19 21:47:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-11-19 21:47:56,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1064. [2024-11-19 21:47:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 841 states have (on average 1.6266349583828774) internal successors, (1368), 874 states have internal predecessors, (1368), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-11-19 21:47:56,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1741 transitions. [2024-11-19 21:47:56,580 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1741 transitions. Word has length 107 [2024-11-19 21:47:56,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:47:56,581 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1741 transitions. [2024-11-19 21:47:56,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 4 states have internal predecessors, (80), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:47:56,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1741 transitions. [2024-11-19 21:47:56,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 21:47:56,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:47:56,586 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:47:56,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 21:47:56,586 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:47:56,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:47:56,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1427762777, now seen corresponding path program 1 times [2024-11-19 21:47:56,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:47:56,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14838691] [2024-11-19 21:47:56,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:47:56,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:47:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:56,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:47:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:56,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:47:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:47:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:47:57,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:47:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:47:57,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:47:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:47:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:47:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:47:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-19 21:47:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:47:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:47:57,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:47:57,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14838691] [2024-11-19 21:47:57,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14838691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:47:57,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:47:57,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 21:47:57,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125464955] [2024-11-19 21:47:57,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:47:57,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:47:57,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:47:57,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:47:57,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:47:57,298 INFO L87 Difference]: Start difference. First operand 1064 states and 1741 transitions. Second operand has 10 states, 9 states have (on average 9.0) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 21:48:02,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:02,637 INFO L93 Difference]: Finished difference Result 2425 states and 4054 transitions. [2024-11-19 21:48:02,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:48:02,637 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2024-11-19 21:48:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:02,647 INFO L225 Difference]: With dead ends: 2425 [2024-11-19 21:48:02,647 INFO L226 Difference]: Without dead ends: 1438 [2024-11-19 21:48:02,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-19 21:48:02,652 INFO L432 NwaCegarLoop]: 449 mSDtfsCounter, 1907 mSDsluCounter, 2466 mSDsCounter, 0 mSdLazyCounter, 5043 mSolverCounterSat, 481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1980 SdHoareTripleChecker+Valid, 2915 SdHoareTripleChecker+Invalid, 5524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 481 IncrementalHoareTripleChecker+Valid, 5043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:48:02,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1980 Valid, 2915 Invalid, 5524 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [481 Valid, 5043 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 21:48:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2024-11-19 21:48:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1064. [2024-11-19 21:48:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 841 states have (on average 1.6254458977407849) internal successors, (1367), 874 states have internal predecessors, (1367), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-11-19 21:48:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1740 transitions. [2024-11-19 21:48:02,911 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1740 transitions. Word has length 108 [2024-11-19 21:48:02,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:02,912 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1740 transitions. [2024-11-19 21:48:02,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.0) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-19 21:48:02,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1740 transitions. [2024-11-19 21:48:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 21:48:02,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:02,916 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:48:02,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:48:02,916 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:02,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:02,917 INFO L85 PathProgramCache]: Analyzing trace with hash -665957063, now seen corresponding path program 1 times [2024-11-19 21:48:02,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:02,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621144624] [2024-11-19 21:48:02,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:02,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:48:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 21:48:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:48:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:48:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:48:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:48:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:48:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:48:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-19 21:48:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:48:03,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:03,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621144624] [2024-11-19 21:48:03,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621144624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:03,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:48:03,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:48:03,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584894235] [2024-11-19 21:48:03,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:03,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:48:03,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:03,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:48:03,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:48:03,514 INFO L87 Difference]: Start difference. First operand 1064 states and 1740 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:48:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:07,530 INFO L93 Difference]: Finished difference Result 2448 states and 4090 transitions. [2024-11-19 21:48:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:48:07,532 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-19 21:48:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:07,541 INFO L225 Difference]: With dead ends: 2448 [2024-11-19 21:48:07,542 INFO L226 Difference]: Without dead ends: 1446 [2024-11-19 21:48:07,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:48:07,547 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 1492 mSDsluCounter, 1215 mSDsCounter, 0 mSdLazyCounter, 2707 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 3049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:48:07,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 1662 Invalid, 3049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2707 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 21:48:07,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2024-11-19 21:48:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 1064. [2024-11-19 21:48:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 841 states have (on average 1.6195005945303211) internal successors, (1362), 874 states have internal predecessors, (1362), 172 states have call successors, (172), 43 states have call predecessors, (172), 50 states have return successors, (201), 170 states have call predecessors, (201), 167 states have call successors, (201) [2024-11-19 21:48:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1735 transitions. [2024-11-19 21:48:07,798 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1735 transitions. Word has length 108 [2024-11-19 21:48:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:07,799 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1735 transitions. [2024-11-19 21:48:07,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 21:48:07,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1735 transitions. [2024-11-19 21:48:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 21:48:07,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:07,802 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:48:07,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:48:07,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:07,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:07,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1551503601, now seen corresponding path program 1 times [2024-11-19 21:48:07,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:07,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158492833] [2024-11-19 21:48:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:07,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-19 21:48:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:48:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 21:48:08,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 21:48:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-19 21:48:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-19 21:48:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-11-19 21:48:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:48:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-19 21:48:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-19 21:48:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 21:48:08,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:08,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158492833] [2024-11-19 21:48:08,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158492833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:08,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:48:08,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 21:48:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240446541] [2024-11-19 21:48:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:08,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:48:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:48:08,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:48:08,540 INFO L87 Difference]: Start difference. First operand 1064 states and 1735 transitions. Second operand has 10 states, 9 states have (on average 9.11111111111111) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)