./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_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_product30.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 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:49:29,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:49:29,227 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:49:29,232 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:49:29,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:49:29,258 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:49:29,259 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:49:29,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:49:29,260 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:49:29,262 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:49:29,262 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:49:29,262 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:49:29,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:49:29,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:49:29,265 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:49:29,265 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:49:29,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:49:29,266 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:49:29,266 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:49:29,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:49:29,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:49:29,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:49:29,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:49:29,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:49:29,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:49:29,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:49:29,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:49:29,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:49:29,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:49:29,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:49:29,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:49:29,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:49:29,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:49:29,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:49:29,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:49:29,272 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:49:29,272 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:49:29,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:49:29,273 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:49:29,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:49:29,273 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:49:29,274 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:49:29,274 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 -> 1493e9da3ad278988eda47a556733ebc5ac5411d3350d76fb478293d9e5d934e [2024-10-14 02:49:29,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:49:29,538 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:49:29,542 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:49:29,543 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:49:29,544 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:49:29,545 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2024-10-14 02:49:30,946 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:49:31,237 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:49:31,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c [2024-10-14 02:49:31,260 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4eeba372/7b1ad13b7ccb4556b0441d1e5b3cf0f4/FLAGb08dcaf65 [2024-10-14 02:49:31,516 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4eeba372/7b1ad13b7ccb4556b0441d1e5b3cf0f4 [2024-10-14 02:49:31,518 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:49:31,519 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:49:31,521 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:49:31,521 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:49:31,526 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:49:31,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:49:31" (1/1) ... [2024-10-14 02:49:31,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714b43c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:31, skipping insertion in model container [2024-10-14 02:49:31,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:49:31" (1/1) ... [2024-10-14 02:49:31,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:49:31,880 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c[11768,11781] [2024-10-14 02:49:32,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:49:32,147 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:49:32,157 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2024-10-14 02:49:32,159 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [414] [2024-10-14 02:49:32,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [452] [2024-10-14 02:49:32,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification9_spec.i","") [461] [2024-10-14 02:49:32,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [626] [2024-10-14 02:49:32,160 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [640] [2024-10-14 02:49:32,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [739] [2024-10-14 02:49:32,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [859] [2024-10-14 02:49:32,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2444] [2024-10-14 02:49:32,161 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [3105] [2024-10-14 02:49:32,197 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec9_product30.cil.c[11768,11781] [2024-10-14 02:49:32,349 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:49:32,382 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:49:32,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32 WrapperNode [2024-10-14 02:49:32,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:49:32,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:49:32,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:49:32,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:49:32,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,435 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,475 INFO L138 Inliner]: procedures = 95, calls = 344, calls flagged for inlining = 27, calls inlined = 23, statements flattened = 872 [2024-10-14 02:49:32,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:49:32,477 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:49:32,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:49:32,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:49:32,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,495 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,539 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-14 02:49:32,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,584 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,608 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:49:32,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:49:32,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:49:32,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:49:32,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (1/1) ... [2024-10-14 02:49:32,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:49:32,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:49:32,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:49:32,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:49:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:49:32,693 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:49:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:49:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-14 02:49:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-14 02:49:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:49:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:49:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:49:32,694 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:49:32,694 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:49:32,695 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:49:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:49:32,695 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:49:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:49:32,695 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:49:32,695 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:49:32,695 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:49:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-14 02:49:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-14 02:49:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-14 02:49:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-14 02:49:32,696 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:49:32,696 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:49:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:49:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:49:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:49:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:49:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:49:32,697 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:49:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:49:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:49:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:49:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:49:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:49:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:49:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:49:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:49:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:49:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:49:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2024-10-14 02:49:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2024-10-14 02:49:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:49:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:49:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:49:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:49:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:49:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:49:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:49:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:49:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:49:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:49:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:49:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:49:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:49:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:49:32,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:49:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:49:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:49:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:49:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:49:32,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:49:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-14 02:49:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-14 02:49:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:49:32,702 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:49:32,702 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:49:32,703 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:49:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:49:32,703 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:49:32,703 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2024-10-14 02:49:32,704 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2024-10-14 02:49:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:49:32,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:49:32,704 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:49:32,704 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:49:32,884 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:49:32,886 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:49:34,120 INFO L? ?]: Removed 455 outVars from TransFormulas that were not future-live. [2024-10-14 02:49:34,120 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:49:34,216 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:49:34,217 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:49:34,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:49:34 BoogieIcfgContainer [2024-10-14 02:49:34,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:49:34,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:49:34,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:49:34,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:49:34,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:49:31" (1/3) ... [2024-10-14 02:49:34,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f091e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:49:34, skipping insertion in model container [2024-10-14 02:49:34,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:49:32" (2/3) ... [2024-10-14 02:49:34,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f091e02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:49:34, skipping insertion in model container [2024-10-14 02:49:34,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:49:34" (3/3) ... [2024-10-14 02:49:34,230 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product30.cil.c [2024-10-14 02:49:34,255 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:49:34,255 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:49:34,346 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:49:34,352 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;@e211b1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:49:34,353 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:49:34,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 555 states, 431 states have (on average 1.7262180974477959) internal successors, (744), 454 states have internal predecessors, (744), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-14 02:49:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 02:49:34,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:34,380 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] [2024-10-14 02:49:34,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:34,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:34,385 INFO L85 PathProgramCache]: Analyzing trace with hash 984736199, now seen corresponding path program 1 times [2024-10-14 02:49:34,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:34,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053125998] [2024-10-14 02:49:34,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:34,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:35,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:35,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:35,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:49:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:35,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:49:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:35,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:35,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:35,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:35,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:35,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:35,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:35,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053125998] [2024-10-14 02:49:35,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053125998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:35,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:35,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:35,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291510721] [2024-10-14 02:49:35,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:35,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:35,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:35,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:35,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:35,735 INFO L87 Difference]: Start difference. First operand has 555 states, 431 states have (on average 1.7262180974477959) internal successors, (744), 454 states have internal predecessors, (744), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (96), 89 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:49:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:40,789 INFO L93 Difference]: Finished difference Result 1246 states and 2128 transitions. [2024-10-14 02:49:40,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:49:40,792 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2024-10-14 02:49:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:40,814 INFO L225 Difference]: With dead ends: 1246 [2024-10-14 02:49:40,814 INFO L226 Difference]: Without dead ends: 700 [2024-10-14 02:49:40,841 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:49:40,847 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 693 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 2806 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 2929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:40,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 1009 Invalid, 2929 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [123 Valid, 2806 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-10-14 02:49:40,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-14 02:49:41,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 551. [2024-10-14 02:49:41,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.7156177156177157) internal successors, (736), 450 states have internal predecessors, (736), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-14 02:49:41,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 923 transitions. [2024-10-14 02:49:41,039 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 923 transitions. Word has length 52 [2024-10-14 02:49:41,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:41,040 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 923 transitions. [2024-10-14 02:49:41,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:49:41,040 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 923 transitions. [2024-10-14 02:49:41,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 02:49:41,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:41,049 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] [2024-10-14 02:49:41,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:49:41,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:41,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:41,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1854082318, now seen corresponding path program 1 times [2024-10-14 02:49:41,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:41,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321414523] [2024-10-14 02:49:41,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:41,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:41,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:41,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:41,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:41,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:41,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:49:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:41,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:41,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:41,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:41,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:41,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:41,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:41,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:41,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321414523] [2024-10-14 02:49:41,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321414523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:41,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:41,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:41,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307877975] [2024-10-14 02:49:41,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:41,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:41,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:41,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:41,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:41,722 INFO L87 Difference]: Start difference. First operand 551 states and 923 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:49:46,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:46,297 INFO L93 Difference]: Finished difference Result 1239 states and 2101 transitions. [2024-10-14 02:49:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:49:46,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-14 02:49:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:46,310 INFO L225 Difference]: With dead ends: 1239 [2024-10-14 02:49:46,310 INFO L226 Difference]: Without dead ends: 700 [2024-10-14 02:49:46,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:49:46,317 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 690 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 2802 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 772 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:46,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [772 Valid, 1015 Invalid, 2923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2802 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-14 02:49:46,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-14 02:49:46,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 551. [2024-10-14 02:49:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.7132867132867133) internal successors, (735), 450 states have internal predecessors, (735), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-14 02:49:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 922 transitions. [2024-10-14 02:49:46,434 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 922 transitions. Word has length 54 [2024-10-14 02:49:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:46,434 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 922 transitions. [2024-10-14 02:49:46,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:49:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 922 transitions. [2024-10-14 02:49:46,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 02:49:46,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:46,436 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] [2024-10-14 02:49:46,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:49:46,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:46,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:46,438 INFO L85 PathProgramCache]: Analyzing trace with hash 2129810193, now seen corresponding path program 1 times [2024-10-14 02:49:46,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:46,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010761281] [2024-10-14 02:49:46,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:46,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:46,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:46,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:46,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:49:46,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:46,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:49:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:47,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:47,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:47,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:47,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:47,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:47,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:47,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:47,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:47,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010761281] [2024-10-14 02:49:47,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010761281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:47,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:47,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:47,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909177449] [2024-10-14 02:49:47,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:47,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:47,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:47,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:47,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:47,047 INFO L87 Difference]: Start difference. First operand 551 states and 922 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:49:51,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:51,155 INFO L93 Difference]: Finished difference Result 1239 states and 2100 transitions. [2024-10-14 02:49:51,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:49:51,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2024-10-14 02:49:51,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:51,163 INFO L225 Difference]: With dead ends: 1239 [2024-10-14 02:49:51,164 INFO L226 Difference]: Without dead ends: 700 [2024-10-14 02:49:51,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:49:51,171 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 688 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:51,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 1006 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-14 02:49:51,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-14 02:49:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 551. [2024-10-14 02:49:51,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.710955710955711) internal successors, (734), 450 states have internal predecessors, (734), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-14 02:49:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 921 transitions. [2024-10-14 02:49:51,319 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 921 transitions. Word has length 55 [2024-10-14 02:49:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:51,319 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 921 transitions. [2024-10-14 02:49:51,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:49:51,319 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 921 transitions. [2024-10-14 02:49:51,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 02:49:51,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:51,322 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] [2024-10-14 02:49:51,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:49:51,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:51,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1381262962, now seen corresponding path program 1 times [2024-10-14 02:49:51,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:51,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802594799] [2024-10-14 02:49:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:51,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:51,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:51,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 02:49:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:51,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:49:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:51,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:51,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:51,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:51,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:51,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802594799] [2024-10-14 02:49:51,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802594799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:51,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:51,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:51,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569301665] [2024-10-14 02:49:51,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:51,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:51,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:51,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:51,951 INFO L87 Difference]: Start difference. First operand 551 states and 921 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:49:55,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:49:55,956 INFO L93 Difference]: Finished difference Result 1239 states and 2099 transitions. [2024-10-14 02:49:55,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:49:55,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2024-10-14 02:49:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:49:55,962 INFO L225 Difference]: With dead ends: 1239 [2024-10-14 02:49:55,962 INFO L226 Difference]: Without dead ends: 700 [2024-10-14 02:49:55,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:49:55,966 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 686 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 2796 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:49:55,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 1015 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2796 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-14 02:49:55,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-14 02:49:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 551. [2024-10-14 02:49:56,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.7086247086247086) internal successors, (733), 450 states have internal predecessors, (733), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-14 02:49:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 920 transitions. [2024-10-14 02:49:56,072 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 920 transitions. Word has length 56 [2024-10-14 02:49:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:49:56,073 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 920 transitions. [2024-10-14 02:49:56,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:49:56,074 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 920 transitions. [2024-10-14 02:49:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 02:49:56,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:49:56,076 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] [2024-10-14 02:49:56,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:49:56,077 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:49:56,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:49:56,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1055041483, now seen corresponding path program 1 times [2024-10-14 02:49:56,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:49:56,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983066177] [2024-10-14 02:49:56,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:49:56,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:49:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:49:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 02:49:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:49:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:49:56,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:49:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:49:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:49:56,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:49:56,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:49:56,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983066177] [2024-10-14 02:49:56,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983066177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:49:56,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:49:56,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:49:56,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349959899] [2024-10-14 02:49:56,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:49:56,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:49:56,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:49:56,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:49:56,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:49:56,677 INFO L87 Difference]: Start difference. First operand 551 states and 920 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:50:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:00,328 INFO L93 Difference]: Finished difference Result 1239 states and 2098 transitions. [2024-10-14 02:50:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:50:00,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-10-14 02:50:00,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:00,334 INFO L225 Difference]: With dead ends: 1239 [2024-10-14 02:50:00,334 INFO L226 Difference]: Without dead ends: 700 [2024-10-14 02:50:00,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:50:00,337 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1149 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1231 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:00,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1231 Valid, 1019 Invalid, 2900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 2641 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 02:50:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-10-14 02:50:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 551. [2024-10-14 02:50:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.7062937062937062) internal successors, (732), 450 states have internal predecessors, (732), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-14 02:50:00,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 919 transitions. [2024-10-14 02:50:00,428 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 919 transitions. Word has length 57 [2024-10-14 02:50:00,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:00,429 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 919 transitions. [2024-10-14 02:50:00,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:50:00,429 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 919 transitions. [2024-10-14 02:50:00,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 02:50:00,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:00,430 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] [2024-10-14 02:50:00,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:50:00,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:00,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:00,431 INFO L85 PathProgramCache]: Analyzing trace with hash 22755286, now seen corresponding path program 1 times [2024-10-14 02:50:00,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:00,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831087499] [2024-10-14 02:50:00,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:00,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:00,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:50:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:50:00,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:00,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831087499] [2024-10-14 02:50:00,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831087499] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:00,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:00,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:50:00,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788983492] [2024-10-14 02:50:00,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:00,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:50:00,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:00,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:50:00,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:50:00,980 INFO L87 Difference]: Start difference. First operand 551 states and 919 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:50:04,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:04,444 INFO L93 Difference]: Finished difference Result 1209 states and 2037 transitions. [2024-10-14 02:50:04,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:50:04,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2024-10-14 02:50:04,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:04,449 INFO L225 Difference]: With dead ends: 1209 [2024-10-14 02:50:04,449 INFO L226 Difference]: Without dead ends: 710 [2024-10-14 02:50:04,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:04,452 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1214 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 2875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:04,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 1019 Invalid, 2875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:50:04,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-10-14 02:50:04,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 551. [2024-10-14 02:50:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 429 states have (on average 1.6946386946386947) internal successors, (727), 450 states have internal predecessors, (727), 96 states have call successors, (96), 26 states have call predecessors, (96), 25 states have return successors, (91), 88 states have call predecessors, (91), 91 states have call successors, (91) [2024-10-14 02:50:04,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 914 transitions. [2024-10-14 02:50:04,538 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 914 transitions. Word has length 58 [2024-10-14 02:50:04,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:04,539 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 914 transitions. [2024-10-14 02:50:04,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:50:04,539 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 914 transitions. [2024-10-14 02:50:04,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 02:50:04,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:04,540 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] [2024-10-14 02:50:04,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:50:04,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:04,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1827450385, now seen corresponding path program 1 times [2024-10-14 02:50:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:04,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901644411] [2024-10-14 02:50:04,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:04,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:04,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:04,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:04,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:04,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:50:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:05,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:05,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:05,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:50:05,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:05,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901644411] [2024-10-14 02:50:05,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901644411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:05,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:05,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 02:50:05,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353651187] [2024-10-14 02:50:05,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:05,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 02:50:05,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:05,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 02:50:05,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:50:05,243 INFO L87 Difference]: Start difference. First operand 551 states and 914 transitions. Second operand has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:50:12,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:12,804 INFO L93 Difference]: Finished difference Result 1237 states and 2084 transitions. [2024-10-14 02:50:12,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 02:50:12,805 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 59 [2024-10-14 02:50:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:12,810 INFO L225 Difference]: With dead ends: 1237 [2024-10-14 02:50:12,810 INFO L226 Difference]: Without dead ends: 746 [2024-10-14 02:50:12,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-10-14 02:50:12,815 INFO L432 NwaCegarLoop]: 304 mSDtfsCounter, 854 mSDsluCounter, 2638 mSDsCounter, 0 mSdLazyCounter, 8202 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2942 SdHoareTripleChecker+Invalid, 8332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 8202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:12,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2942 Invalid, 8332 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [130 Valid, 8202 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-14 02:50:12,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2024-10-14 02:50:12,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 567. [2024-10-14 02:50:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 441 states have (on average 1.6870748299319729) internal successors, (744), 464 states have internal predecessors, (744), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-14 02:50:12,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 937 transitions. [2024-10-14 02:50:12,909 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 937 transitions. Word has length 59 [2024-10-14 02:50:12,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:12,910 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 937 transitions. [2024-10-14 02:50:12,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.230769230769231) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:50:12,910 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 937 transitions. [2024-10-14 02:50:12,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 02:50:12,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:12,912 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:50:12,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:50:12,912 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:12,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:12,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1561615390, now seen corresponding path program 1 times [2024-10-14 02:50:12,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:12,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23824997] [2024-10-14 02:50:12,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:12,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:50:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 02:50:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:13,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:50:13,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:13,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23824997] [2024-10-14 02:50:13,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23824997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:13,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:13,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:50:13,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673824073] [2024-10-14 02:50:13,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:13,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:50:13,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:13,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:50:13,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:50:13,444 INFO L87 Difference]: Start difference. First operand 567 states and 937 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:16,741 INFO L93 Difference]: Finished difference Result 1247 states and 2091 transitions. [2024-10-14 02:50:16,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:50:16,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 64 [2024-10-14 02:50:16,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:16,746 INFO L225 Difference]: With dead ends: 1247 [2024-10-14 02:50:16,746 INFO L226 Difference]: Without dead ends: 736 [2024-10-14 02:50:16,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:16,748 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1208 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:16,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 1040 Invalid, 2856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 02:50:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-14 02:50:16,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 567. [2024-10-14 02:50:16,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 441 states have (on average 1.6757369614512472) internal successors, (739), 464 states have internal predecessors, (739), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-14 02:50:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 932 transitions. [2024-10-14 02:50:16,841 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 932 transitions. Word has length 64 [2024-10-14 02:50:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:16,842 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 932 transitions. [2024-10-14 02:50:16,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 932 transitions. [2024-10-14 02:50:16,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 02:50:16,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:16,844 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:50:16,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:50:16,844 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:16,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1075895168, now seen corresponding path program 1 times [2024-10-14 02:50:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:16,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291144307] [2024-10-14 02:50:16,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:16,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:50:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 02:50:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:50:17,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:17,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291144307] [2024-10-14 02:50:17,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291144307] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:17,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:17,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:50:17,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523450567] [2024-10-14 02:50:17,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:17,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:50:17,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:17,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:50:17,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:50:17,305 INFO L87 Difference]: Start difference. First operand 567 states and 932 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:20,875 INFO L93 Difference]: Finished difference Result 1247 states and 2086 transitions. [2024-10-14 02:50:20,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:50:20,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2024-10-14 02:50:20,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:20,881 INFO L225 Difference]: With dead ends: 1247 [2024-10-14 02:50:20,881 INFO L226 Difference]: Without dead ends: 736 [2024-10-14 02:50:20,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:20,883 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 741 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 2724 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:20,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1042 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2724 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 02:50:20,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-14 02:50:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 567. [2024-10-14 02:50:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 441 states have (on average 1.6643990929705215) internal successors, (734), 464 states have internal predecessors, (734), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-14 02:50:20,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 927 transitions. [2024-10-14 02:50:20,979 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 927 transitions. Word has length 65 [2024-10-14 02:50:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:20,980 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 927 transitions. [2024-10-14 02:50:20,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 927 transitions. [2024-10-14 02:50:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 02:50:20,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:20,982 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:50:20,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:50:20,982 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:20,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1320576039, now seen corresponding path program 1 times [2024-10-14 02:50:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550959315] [2024-10-14 02:50:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:21,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:21,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:50:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:21,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:21,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:21,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:21,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:21,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 02:50:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:50:21,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:21,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550959315] [2024-10-14 02:50:21,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550959315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:21,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:21,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:50:21,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624979059] [2024-10-14 02:50:21,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:21,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:50:21,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:21,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:50:21,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:50:21,500 INFO L87 Difference]: Start difference. First operand 567 states and 927 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:24,871 INFO L93 Difference]: Finished difference Result 1247 states and 2081 transitions. [2024-10-14 02:50:24,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:50:24,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2024-10-14 02:50:24,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:24,876 INFO L225 Difference]: With dead ends: 1247 [2024-10-14 02:50:24,876 INFO L226 Difference]: Without dead ends: 736 [2024-10-14 02:50:24,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:24,879 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 1213 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 2548 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:24,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 998 Invalid, 2813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2548 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 02:50:24,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-14 02:50:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 567. [2024-10-14 02:50:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 441 states have (on average 1.653061224489796) internal successors, (729), 464 states have internal predecessors, (729), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-14 02:50:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 922 transitions. [2024-10-14 02:50:24,976 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 922 transitions. Word has length 66 [2024-10-14 02:50:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:24,976 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 922 transitions. [2024-10-14 02:50:24,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 922 transitions. [2024-10-14 02:50:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 02:50:24,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:24,978 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:50:24,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:50:24,978 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:24,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:24,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1658819960, now seen corresponding path program 1 times [2024-10-14 02:50:24,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:24,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862301330] [2024-10-14 02:50:24,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:24,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:25,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:25,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:50:25,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 02:50:25,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:50:25,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862301330] [2024-10-14 02:50:25,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862301330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:25,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:25,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:50:25,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686138908] [2024-10-14 02:50:25,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:25,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:50:25,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:25,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:50:25,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:50:25,571 INFO L87 Difference]: Start difference. First operand 567 states and 922 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 02:50:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:30,715 INFO L93 Difference]: Finished difference Result 1233 states and 2049 transitions. [2024-10-14 02:50:30,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:50:30,715 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 66 [2024-10-14 02:50:30,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:30,719 INFO L225 Difference]: With dead ends: 1233 [2024-10-14 02:50:30,719 INFO L226 Difference]: Without dead ends: 734 [2024-10-14 02:50:30,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:50:30,721 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 728 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 4927 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1832 SdHoareTripleChecker+Invalid, 5047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 4927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:30,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1832 Invalid, 5047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 4927 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 02:50:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-14 02:50:30,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 569. [2024-10-14 02:50:30,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 443 states have (on average 1.6478555304740405) internal successors, (730), 466 states have internal predecessors, (730), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-14 02:50:30,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 923 transitions. [2024-10-14 02:50:30,818 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 923 transitions. Word has length 66 [2024-10-14 02:50:30,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:30,819 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 923 transitions. [2024-10-14 02:50:30,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-14 02:50:30,819 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 923 transitions. [2024-10-14 02:50:30,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 02:50:30,821 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:30,821 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:50:30,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:50:30,822 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:30,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:30,822 INFO L85 PathProgramCache]: Analyzing trace with hash 401980645, now seen corresponding path program 1 times [2024-10-14 02:50:30,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:30,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144344542] [2024-10-14 02:50:30,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:30,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:30,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:50:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 02:50:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:50:31,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144344542] [2024-10-14 02:50:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144344542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:31,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:31,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:50:31,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142476328] [2024-10-14 02:50:31,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:31,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:50:31,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:31,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:50:31,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:50:31,300 INFO L87 Difference]: Start difference. First operand 569 states and 923 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:34,495 INFO L93 Difference]: Finished difference Result 1253 states and 2078 transitions. [2024-10-14 02:50:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:50:34,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2024-10-14 02:50:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:34,503 INFO L225 Difference]: With dead ends: 1253 [2024-10-14 02:50:34,503 INFO L226 Difference]: Without dead ends: 740 [2024-10-14 02:50:34,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:50:34,506 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 1204 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 2541 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 2795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:34,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 1029 Invalid, 2795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2541 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 02:50:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2024-10-14 02:50:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 569. [2024-10-14 02:50:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 443 states have (on average 1.636568848758465) internal successors, (725), 466 states have internal predecessors, (725), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-14 02:50:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 918 transitions. [2024-10-14 02:50:34,602 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 918 transitions. Word has length 67 [2024-10-14 02:50:34,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:34,602 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 918 transitions. [2024-10-14 02:50:34,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:34,602 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 918 transitions. [2024-10-14 02:50:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 02:50:34,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:34,604 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:50:34,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:50:34,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:34,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:34,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1497815390, now seen corresponding path program 1 times [2024-10-14 02:50:34,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:34,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883008927] [2024-10-14 02:50:34,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:34,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:34,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:34,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:35,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:50:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:35,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:35,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:35,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:35,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:35,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 02:50:35,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:35,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:50:35,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:35,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883008927] [2024-10-14 02:50:35,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883008927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:35,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:35,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:50:35,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85994724] [2024-10-14 02:50:35,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:35,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:50:35,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:35,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:50:35,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:50:35,083 INFO L87 Difference]: Start difference. First operand 569 states and 918 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:38,368 INFO L93 Difference]: Finished difference Result 1227 states and 2033 transitions. [2024-10-14 02:50:38,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:50:38,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 67 [2024-10-14 02:50:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:38,373 INFO L225 Difference]: With dead ends: 1227 [2024-10-14 02:50:38,373 INFO L226 Difference]: Without dead ends: 730 [2024-10-14 02:50:38,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:50:38,375 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1191 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1273 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 2774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:38,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1273 Valid, 967 Invalid, 2774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 02:50:38,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-14 02:50:38,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 569. [2024-10-14 02:50:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 443 states have (on average 1.6343115124153498) internal successors, (724), 466 states have internal predecessors, (724), 97 states have call successors, (97), 26 states have call predecessors, (97), 28 states have return successors, (96), 90 states have call predecessors, (96), 92 states have call successors, (96) [2024-10-14 02:50:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 917 transitions. [2024-10-14 02:50:38,475 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 917 transitions. Word has length 67 [2024-10-14 02:50:38,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:38,476 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 917 transitions. [2024-10-14 02:50:38,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 917 transitions. [2024-10-14 02:50:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 02:50:38,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:38,478 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:50:38,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 02:50:38,478 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:38,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:38,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2076526700, now seen corresponding path program 1 times [2024-10-14 02:50:38,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:38,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993272146] [2024-10-14 02:50:38,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:38,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:38,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:38,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:50:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:38,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 02:50:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:38,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:50:38,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:38,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993272146] [2024-10-14 02:50:38,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993272146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:38,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:38,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:50:38,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938662684] [2024-10-14 02:50:38,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:38,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:50:38,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:50:38,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:50:38,945 INFO L87 Difference]: Start difference. First operand 569 states and 917 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:50:42,422 INFO L93 Difference]: Finished difference Result 1279 states and 2097 transitions. [2024-10-14 02:50:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:50:42,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2024-10-14 02:50:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:50:42,426 INFO L225 Difference]: With dead ends: 1279 [2024-10-14 02:50:42,426 INFO L226 Difference]: Without dead ends: 679 [2024-10-14 02:50:42,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:50:42,428 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 1146 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 2539 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 2799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 2539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:50:42,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 986 Invalid, 2799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 2539 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 02:50:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-10-14 02:50:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 528. [2024-10-14 02:50:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 405 states have (on average 1.6592592592592592) internal successors, (672), 426 states have internal predecessors, (672), 96 states have call successors, (96), 26 states have call predecessors, (96), 26 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2024-10-14 02:50:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 861 transitions. [2024-10-14 02:50:42,521 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 861 transitions. Word has length 68 [2024-10-14 02:50:42,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:50:42,522 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 861 transitions. [2024-10-14 02:50:42,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-14 02:50:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 861 transitions. [2024-10-14 02:50:42,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 02:50:42,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:50:42,525 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-14 02:50:42,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 02:50:42,525 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:50:42,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:50:42,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1391323679, now seen corresponding path program 1 times [2024-10-14 02:50:42,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:50:42,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593473665] [2024-10-14 02:50:42,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:50:42,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:50:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:50:42,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:42,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:43,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:50:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:43,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:50:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:43,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:50:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:43,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:50:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 02:50:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:50:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:50:43,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:50:43,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593473665] [2024-10-14 02:50:43,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593473665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:50:43,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:50:43,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 02:50:43,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617105711] [2024-10-14 02:50:43,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:50:43,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 02:50:43,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:50:43,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 02:50:43,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:50:43,200 INFO L87 Difference]: Start difference. First operand 528 states and 861 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 3 states have call successors, (9)