./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0d12edbd4df2f08d75221f3c96b68e50e6394815b34a699d313e71ea24bf9c38 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:33:05,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:33:05,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:33:05,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:33:05,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:33:05,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:33:05,284 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:33:05,284 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:33:05,285 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:33:05,285 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:33:05,285 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:33:05,285 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:33:05,286 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:33:05,286 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:33:05,286 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:33:05,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:33:05,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:33:05,287 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:33:05,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:33:05,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:33:05,288 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:33:05,289 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:33:05,290 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:33:05,290 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:33:05,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:33:05,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:33:05,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:33:05,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:33:05,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:33:05,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:33:05,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:33:05,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:33:05,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:33:05,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:33:05,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:33:05,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:33:05,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:33:05,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:33:05,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:33:05,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:33:05,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:33:05,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:33:05,296 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 -> 0d12edbd4df2f08d75221f3c96b68e50e6394815b34a699d313e71ea24bf9c38 [2024-11-11 20:33:05,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:33:05,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:33:05,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:33:05,595 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:33:05,595 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:33:05,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c [2024-11-11 20:33:07,237 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:33:07,493 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:33:07,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c [2024-11-11 20:33:07,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57dbace8e/c9dd9418ec1840fe89a39592d580773b/FLAGdfc13ffda [2024-11-11 20:33:07,532 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57dbace8e/c9dd9418ec1840fe89a39592d580773b [2024-11-11 20:33:07,535 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:33:07,536 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:33:07,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:33:07,537 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:33:07,541 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:33:07,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:33:07" (1/1) ... [2024-11-11 20:33:07,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1445c7a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:07, skipping insertion in model container [2024-11-11 20:33:07,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:33:07" (1/1) ... [2024-11-11 20:33:07,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:33:07,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c[40506,40519] [2024-11-11 20:33:07,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:33:08,013 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:33:08,022 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-11-11 20:33:08,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [716] [2024-11-11 20:33:08,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [754] [2024-11-11 20:33:08,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1120] [2024-11-11 20:33:08,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1220] [2024-11-11 20:33:08,024 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1340] [2024-11-11 20:33:08,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [1358] [2024-11-11 20:33:08,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1548] [2024-11-11 20:33:08,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1897] [2024-11-11 20:33:08,025 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1906] [2024-11-11 20:33:08,100 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product29.cil.c[40506,40519] [2024-11-11 20:33:08,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:33:08,220 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:33:08,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08 WrapperNode [2024-11-11 20:33:08,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:33:08,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:33:08,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:33:08,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:33:08,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,282 INFO L138 Inliner]: procedures = 91, calls = 347, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 927 [2024-11-11 20:33:08,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:33:08,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:33:08,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:33:08,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:33:08,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,299 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,317 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-11-11 20:33:08,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,321 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,345 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,372 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:33:08,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:33:08,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:33:08,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:33:08,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (1/1) ... [2024-11-11 20:33:08,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:33:08,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:33:08,423 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:33:08,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:33:08,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:33:08,468 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-11-11 20:33:08,468 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-11-11 20:33:08,468 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-11-11 20:33:08,469 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-11-11 20:33:08,469 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-11-11 20:33:08,469 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-11-11 20:33:08,469 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-11-11 20:33:08,469 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-11-11 20:33:08,469 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-11-11 20:33:08,470 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-11-11 20:33:08,470 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-11-11 20:33:08,470 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-11-11 20:33:08,470 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-11-11 20:33:08,470 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-11-11 20:33:08,471 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-11-11 20:33:08,471 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-11-11 20:33:08,471 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-11-11 20:33:08,471 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-11-11 20:33:08,473 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-11 20:33:08,473 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-11 20:33:08,473 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-11-11 20:33:08,473 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-11-11 20:33:08,473 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-11-11 20:33:08,473 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-11-11 20:33:08,474 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-11-11 20:33:08,474 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-11-11 20:33:08,474 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-11-11 20:33:08,474 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-11-11 20:33:08,474 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-11-11 20:33:08,474 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-11-11 20:33:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-11-11 20:33:08,475 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-11-11 20:33:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-11-11 20:33:08,475 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-11-11 20:33:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-11-11 20:33:08,475 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-11-11 20:33:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-11-11 20:33:08,475 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-11-11 20:33:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-11-11 20:33:08,475 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-11-11 20:33:08,475 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-11-11 20:33:08,476 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-11-11 20:33:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:33:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:33:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:33:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:33:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-11 20:33:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-11 20:33:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-11 20:33:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-11 20:33:08,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-11 20:33:08,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-11 20:33:08,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-11 20:33:08,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-11 20:33:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-11 20:33:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-11 20:33:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-11-11 20:33:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-11-11 20:33:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-11-11 20:33:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-11-11 20:33:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-11-11 20:33:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-11-11 20:33:08,478 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-11-11 20:33:08,478 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-11-11 20:33:08,479 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-11-11 20:33:08,479 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-11-11 20:33:08,480 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-11-11 20:33:08,480 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-11-11 20:33:08,480 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-11-11 20:33:08,480 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-11-11 20:33:08,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:33:08,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:33:08,480 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-11-11 20:33:08,480 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-11-11 20:33:08,655 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:33:08,657 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:33:09,616 INFO L? ?]: Removed 470 outVars from TransFormulas that were not future-live. [2024-11-11 20:33:09,616 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:33:09,637 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:33:09,638 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:33:09,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:33:09 BoogieIcfgContainer [2024-11-11 20:33:09,638 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:33:09,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:33:09,640 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:33:09,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:33:09,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:33:07" (1/3) ... [2024-11-11 20:33:09,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f301780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:33:09, skipping insertion in model container [2024-11-11 20:33:09,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:33:08" (2/3) ... [2024-11-11 20:33:09,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f301780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:33:09, skipping insertion in model container [2024-11-11 20:33:09,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:33:09" (3/3) ... [2024-11-11 20:33:09,644 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product29.cil.c [2024-11-11 20:33:09,656 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:33:09,656 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:33:09,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:33:09,730 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;@4ae045b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:33:09,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:33:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 597 states, 463 states have (on average 1.6781857451403888) internal successors, (777), 481 states have internal predecessors, (777), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) [2024-11-11 20:33:09,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 20:33:09,757 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:09,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:09,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:09,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2006006506, now seen corresponding path program 1 times [2024-11-11 20:33:09,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:09,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235944986] [2024-11-11 20:33:09,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:09,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:10,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:10,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:10,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:10,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:33:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:10,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:10,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:11,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:33:11,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:11,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:33:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:33:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:33:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:11,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:33:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:11,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:33:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:11,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:33:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:33:11,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:11,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235944986] [2024-11-11 20:33:11,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235944986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:11,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:11,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:33:11,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751854229] [2024-11-11 20:33:11,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:11,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:33:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:11,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:33:11,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:33:11,097 INFO L87 Difference]: Start difference. First operand has 597 states, 463 states have (on average 1.6781857451403888) internal successors, (777), 481 states have internal predecessors, (777), 106 states have call successors, (106), 26 states have call predecessors, (106), 26 states have return successors, (106), 103 states have call predecessors, (106), 106 states have call successors, (106) Second operand has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:33:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:33:18,968 INFO L93 Difference]: Finished difference Result 1554 states and 2682 transitions. [2024-11-11 20:33:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 20:33:18,974 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2024-11-11 20:33:18,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:33:18,998 INFO L225 Difference]: With dead ends: 1554 [2024-11-11 20:33:18,999 INFO L226 Difference]: Without dead ends: 957 [2024-11-11 20:33:19,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:33:19,011 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 1763 mSDsluCounter, 2740 mSDsCounter, 0 mSdLazyCounter, 5797 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 3241 SdHoareTripleChecker+Invalid, 6272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 5797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:33:19,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 3241 Invalid, 6272 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [475 Valid, 5797 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2024-11-11 20:33:19,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2024-11-11 20:33:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 600. [2024-11-11 20:33:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 466 states have (on average 1.6695278969957081) internal successors, (778), 484 states have internal predecessors, (778), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2024-11-11 20:33:19,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 991 transitions. [2024-11-11 20:33:19,264 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 991 transitions. Word has length 99 [2024-11-11 20:33:19,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:33:19,265 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 991 transitions. [2024-11-11 20:33:19,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.888888888888889) internal successors, (71), 6 states have internal predecessors, (71), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:33:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 991 transitions. [2024-11-11 20:33:19,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 20:33:19,272 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:19,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:19,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 20:33:19,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:19,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2109230418, now seen corresponding path program 1 times [2024-11-11 20:33:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:19,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121302159] [2024-11-11 20:33:19,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:19,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:19,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:19,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:33:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:19,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:19,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:19,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:19,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:33:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:19,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:33:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:19,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:33:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:19,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:33:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:20,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:33:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:20,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:33:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:20,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:33:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:20,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:33:20,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:20,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121302159] [2024-11-11 20:33:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121302159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:20,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:20,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:33:20,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260198114] [2024-11-11 20:33:20,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:20,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:33:20,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:20,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:33:20,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:33:20,059 INFO L87 Difference]: Start difference. First operand 600 states and 991 transitions. Second operand has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:33:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:33:26,533 INFO L93 Difference]: Finished difference Result 1541 states and 2625 transitions. [2024-11-11 20:33:26,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:33:26,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2024-11-11 20:33:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:33:26,539 INFO L225 Difference]: With dead ends: 1541 [2024-11-11 20:33:26,539 INFO L226 Difference]: Without dead ends: 957 [2024-11-11 20:33:26,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:33:26,542 INFO L435 NwaCegarLoop]: 471 mSDtfsCounter, 1718 mSDsluCounter, 2551 mSDsCounter, 0 mSdLazyCounter, 5684 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 3022 SdHoareTripleChecker+Invalid, 6167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 5684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:33:26,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1830 Valid, 3022 Invalid, 6167 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [483 Valid, 5684 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-11 20:33:26,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2024-11-11 20:33:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 600. [2024-11-11 20:33:26,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 466 states have (on average 1.667381974248927) internal successors, (777), 484 states have internal predecessors, (777), 107 states have call successors, (107), 26 states have call predecessors, (107), 26 states have return successors, (106), 102 states have call predecessors, (106), 104 states have call successors, (106) [2024-11-11 20:33:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 990 transitions. [2024-11-11 20:33:26,725 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 990 transitions. Word has length 100 [2024-11-11 20:33:26,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:33:26,726 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 990 transitions. [2024-11-11 20:33:26,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.0) internal successors, (72), 6 states have internal predecessors, (72), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:33:26,726 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 990 transitions. [2024-11-11 20:33:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 20:33:26,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:26,729 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:26,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 20:33:26,730 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:26,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash -343069422, now seen corresponding path program 1 times [2024-11-11 20:33:26,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:26,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011348937] [2024-11-11 20:33:26,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:26,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:33:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-11 20:33:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:33:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:33:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:33:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:33:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:33:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:33:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:33:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:27,281 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:33:27,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:27,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011348937] [2024-11-11 20:33:27,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011348937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:27,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:27,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:33:27,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20890960] [2024-11-11 20:33:27,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:27,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:33:27,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:27,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:33:27,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:33:27,287 INFO L87 Difference]: Start difference. First operand 600 states and 990 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:33:32,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:33:32,238 INFO L93 Difference]: Finished difference Result 1535 states and 2608 transitions. [2024-11-11 20:33:32,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:33:32,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 100 [2024-11-11 20:33:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:33:32,244 INFO L225 Difference]: With dead ends: 1535 [2024-11-11 20:33:32,244 INFO L226 Difference]: Without dead ends: 920 [2024-11-11 20:33:32,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:33:32,248 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 1101 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 3174 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 1761 SdHoareTripleChecker+Invalid, 3446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 3174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:33:32,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 1761 Invalid, 3446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 3174 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-11 20:33:32,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-11 20:33:32,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 576. [2024-11-11 20:33:32,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 445 states have (on average 1.658426966292135) internal successors, (738), 461 states have internal predecessors, (738), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-11 20:33:32,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 947 transitions. [2024-11-11 20:33:32,360 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 947 transitions. Word has length 100 [2024-11-11 20:33:32,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:33:32,361 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 947 transitions. [2024-11-11 20:33:32,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:33:32,361 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 947 transitions. [2024-11-11 20:33:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 20:33:32,363 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:32,363 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:32,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 20:33:32,363 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:32,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash -2024065694, now seen corresponding path program 1 times [2024-11-11 20:33:32,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:32,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689189836] [2024-11-11 20:33:32,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:32,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:32,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:32,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:32,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:33:32,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:32,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:32,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:32,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:33:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:32,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 20:33:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:32,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:33:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:32,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:33:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:32,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:33:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:32,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:33:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:33,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:33:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:33:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689189836] [2024-11-11 20:33:33,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689189836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:33,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:33,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:33:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714496934] [2024-11-11 20:33:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:33,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:33:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:33,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:33:33,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:33:33,007 INFO L87 Difference]: Start difference. First operand 576 states and 947 transitions. Second operand has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:33:39,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:33:39,178 INFO L93 Difference]: Finished difference Result 1498 states and 2539 transitions. [2024-11-11 20:33:39,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 20:33:39,178 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 101 [2024-11-11 20:33:39,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:33:39,183 INFO L225 Difference]: With dead ends: 1498 [2024-11-11 20:33:39,183 INFO L226 Difference]: Without dead ends: 914 [2024-11-11 20:33:39,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:33:39,186 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 2222 mSDsluCounter, 2640 mSDsCounter, 0 mSdLazyCounter, 5465 mSolverCounterSat, 680 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2332 SdHoareTripleChecker+Valid, 3134 SdHoareTripleChecker+Invalid, 6145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 5465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:33:39,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2332 Valid, 3134 Invalid, 6145 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [680 Valid, 5465 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-11 20:33:39,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2024-11-11 20:33:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 570. [2024-11-11 20:33:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 439 states have (on average 1.6514806378132119) internal successors, (725), 455 states have internal predecessors, (725), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-11 20:33:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 934 transitions. [2024-11-11 20:33:39,285 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 934 transitions. Word has length 101 [2024-11-11 20:33:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:33:39,285 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 934 transitions. [2024-11-11 20:33:39,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:33:39,286 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 934 transitions. [2024-11-11 20:33:39,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 20:33:39,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:39,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:39,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 20:33:39,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:39,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash 647112022, now seen corresponding path program 1 times [2024-11-11 20:33:39,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:39,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693518195] [2024-11-11 20:33:39,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:39,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:39,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:39,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:33:39,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:39,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:39,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:40,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:33:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:40,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:33:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:40,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:33:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:40,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:33:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:40,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:33:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:33:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:40,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:33:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:33:40,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:40,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693518195] [2024-11-11 20:33:40,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693518195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:40,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:40,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:33:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586395778] [2024-11-11 20:33:40,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:40,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:33:40,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:33:40,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:33:40,064 INFO L87 Difference]: Start difference. First operand 570 states and 934 transitions. Second operand has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:33:45,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:33:45,784 INFO L93 Difference]: Finished difference Result 1468 states and 2488 transitions. [2024-11-11 20:33:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:33:45,784 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2024-11-11 20:33:45,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:33:45,789 INFO L225 Difference]: With dead ends: 1468 [2024-11-11 20:33:45,789 INFO L226 Difference]: Without dead ends: 914 [2024-11-11 20:33:45,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:33:45,791 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1655 mSDsluCounter, 2525 mSDsCounter, 0 mSdLazyCounter, 5332 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1766 SdHoareTripleChecker+Valid, 2988 SdHoareTripleChecker+Invalid, 5815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 5332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:33:45,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1766 Valid, 2988 Invalid, 5815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 5332 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-11 20:33:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2024-11-11 20:33:45,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 570. [2024-11-11 20:33:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 439 states have (on average 1.6492027334851935) internal successors, (724), 455 states have internal predecessors, (724), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-11 20:33:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 933 transitions. [2024-11-11 20:33:45,888 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 933 transitions. Word has length 102 [2024-11-11 20:33:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:33:45,888 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 933 transitions. [2024-11-11 20:33:45,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:33:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 933 transitions. [2024-11-11 20:33:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 20:33:45,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:45,890 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:45,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 20:33:45,891 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:45,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:45,891 INFO L85 PathProgramCache]: Analyzing trace with hash -600205313, now seen corresponding path program 1 times [2024-11-11 20:33:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:45,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639640141] [2024-11-11 20:33:45,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:33:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 20:33:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 20:33:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:33:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:33:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:33:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:33:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:33:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:33:46,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:46,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639640141] [2024-11-11 20:33:46,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639640141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:46,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:46,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:33:46,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946634215] [2024-11-11 20:33:46,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:46,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:33:46,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:46,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:33:46,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:33:46,438 INFO L87 Difference]: Start difference. First operand 570 states and 933 transitions. Second operand has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:33:52,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:33:52,991 INFO L93 Difference]: Finished difference Result 1486 states and 2508 transitions. [2024-11-11 20:33:52,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 20:33:52,992 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2024-11-11 20:33:52,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:33:52,999 INFO L225 Difference]: With dead ends: 1486 [2024-11-11 20:33:52,999 INFO L226 Difference]: Without dead ends: 908 [2024-11-11 20:33:53,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:33:53,002 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 1645 mSDsluCounter, 2617 mSDsCounter, 0 mSdLazyCounter, 5493 mSolverCounterSat, 467 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 3098 SdHoareTripleChecker+Invalid, 5960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 467 IncrementalHoareTripleChecker+Valid, 5493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:33:53,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 3098 Invalid, 5960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [467 Valid, 5493 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-11 20:33:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-11 20:33:53,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 564. [2024-11-11 20:33:53,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 433 states have (on average 1.6420323325635104) internal successors, (711), 449 states have internal predecessors, (711), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-11 20:33:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 920 transitions. [2024-11-11 20:33:53,272 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 920 transitions. Word has length 103 [2024-11-11 20:33:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:33:53,273 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 920 transitions. [2024-11-11 20:33:53,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.333333333333334) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:33:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 920 transitions. [2024-11-11 20:33:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-11 20:33:53,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:53,276 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:53,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:33:53,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:53,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash -839754217, now seen corresponding path program 1 times [2024-11-11 20:33:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:53,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583737020] [2024-11-11 20:33:53,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:53,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:53,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:53,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:33:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 20:33:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:33:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:33:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:33:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:33:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:33:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:33:53,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:53,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:33:53,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:53,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583737020] [2024-11-11 20:33:53,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583737020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:53,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:53,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:33:53,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983625158] [2024-11-11 20:33:53,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:53,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:33:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:53,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:33:53,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:33:53,970 INFO L87 Difference]: Start difference. First operand 564 states and 920 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:33:58,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:33:58,359 INFO L93 Difference]: Finished difference Result 1456 states and 2459 transitions. [2024-11-11 20:33:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:33:58,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2024-11-11 20:33:58,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:33:58,364 INFO L225 Difference]: With dead ends: 1456 [2024-11-11 20:33:58,365 INFO L226 Difference]: Without dead ends: 908 [2024-11-11 20:33:58,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:33:58,367 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 1070 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 2944 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:33:58,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1731 Invalid, 3214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2944 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-11 20:33:58,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-11 20:33:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 564. [2024-11-11 20:33:58,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 433 states have (on average 1.6397228637413395) internal successors, (710), 449 states have internal predecessors, (710), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-11 20:33:58,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 919 transitions. [2024-11-11 20:33:58,494 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 919 transitions. Word has length 104 [2024-11-11 20:33:58,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:33:58,494 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 919 transitions. [2024-11-11 20:33:58,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 20:33:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 919 transitions. [2024-11-11 20:33:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 20:33:58,496 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:33:58,496 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:33:58,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:33:58,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:33:58,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:33:58,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1866795101, now seen corresponding path program 1 times [2024-11-11 20:33:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:33:58,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257644722] [2024-11-11 20:33:58,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:33:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:33:58,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:33:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:33:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:33:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:33:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:33:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:33:58,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:33:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:33:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:33:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:33:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:33:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:33:58,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:33:58,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257644722] [2024-11-11 20:33:58,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257644722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:33:58,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:33:58,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:33:58,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721130939] [2024-11-11 20:33:58,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:33:58,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:33:58,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:33:58,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:33:58,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:33:58,982 INFO L87 Difference]: Start difference. First operand 564 states and 919 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:34:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:04,732 INFO L93 Difference]: Finished difference Result 1474 states and 2477 transitions. [2024-11-11 20:34:04,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-11 20:34:04,732 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2024-11-11 20:34:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:04,736 INFO L225 Difference]: With dead ends: 1474 [2024-11-11 20:34:04,736 INFO L226 Difference]: Without dead ends: 902 [2024-11-11 20:34:04,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-11 20:34:04,738 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 1092 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 5397 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1203 SdHoareTripleChecker+Valid, 3133 SdHoareTripleChecker+Invalid, 5669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 5397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:04,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1203 Valid, 3133 Invalid, 5669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 5397 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-11 20:34:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-11 20:34:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 558. [2024-11-11 20:34:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 427 states have (on average 1.6323185011709602) internal successors, (697), 443 states have internal predecessors, (697), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-11 20:34:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 906 transitions. [2024-11-11 20:34:04,838 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 906 transitions. Word has length 105 [2024-11-11 20:34:04,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:04,838 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 906 transitions. [2024-11-11 20:34:04,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:34:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 906 transitions. [2024-11-11 20:34:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-11 20:34:04,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:04,840 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:04,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:34:04,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:04,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:04,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1252853566, now seen corresponding path program 1 times [2024-11-11 20:34:04,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:04,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962343886] [2024-11-11 20:34:04,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:04,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:34:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-11 20:34:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:34:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:34:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:34:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:34:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:34:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:34:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:34:05,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:05,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962343886] [2024-11-11 20:34:05,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962343886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:05,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:05,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:34:05,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737106749] [2024-11-11 20:34:05,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:05,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:34:05,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:05,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:34:05,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:05,286 INFO L87 Difference]: Start difference. First operand 558 states and 906 transitions. Second operand has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:34:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:10,951 INFO L93 Difference]: Finished difference Result 1444 states and 2430 transitions. [2024-11-11 20:34:10,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:34:10,951 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 105 [2024-11-11 20:34:10,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:10,955 INFO L225 Difference]: With dead ends: 1444 [2024-11-11 20:34:10,956 INFO L226 Difference]: Without dead ends: 902 [2024-11-11 20:34:10,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:34:10,958 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 2081 mSDsluCounter, 2565 mSDsCounter, 0 mSdLazyCounter, 5101 mSolverCounterSat, 679 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2191 SdHoareTripleChecker+Valid, 3043 SdHoareTripleChecker+Invalid, 5780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 679 IncrementalHoareTripleChecker+Valid, 5101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:10,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2191 Valid, 3043 Invalid, 5780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [679 Valid, 5101 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-11 20:34:10,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-11 20:34:11,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 558. [2024-11-11 20:34:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 427 states have (on average 1.629976580796253) internal successors, (696), 443 states have internal predecessors, (696), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-11 20:34:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 905 transitions. [2024-11-11 20:34:11,063 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 905 transitions. Word has length 105 [2024-11-11 20:34:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:11,063 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 905 transitions. [2024-11-11 20:34:11,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.555555555555555) internal successors, (77), 6 states have internal predecessors, (77), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:34:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 905 transitions. [2024-11-11 20:34:11,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-11 20:34:11,065 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:11,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:11,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:34:11,065 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:11,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:11,065 INFO L85 PathProgramCache]: Analyzing trace with hash 88617629, now seen corresponding path program 1 times [2024-11-11 20:34:11,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:11,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318820871] [2024-11-11 20:34:11,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:11,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:34:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 20:34:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 20:34:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:34:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:34:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:34:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:34:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:34:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:34:11,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:11,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318820871] [2024-11-11 20:34:11,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318820871] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:11,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:11,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:34:11,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320037887] [2024-11-11 20:34:11,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:11,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:34:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:11,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:34:11,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:11,631 INFO L87 Difference]: Start difference. First operand 558 states and 905 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:34:16,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:16,624 INFO L93 Difference]: Finished difference Result 1450 states and 2434 transitions. [2024-11-11 20:34:16,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:34:16,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-11 20:34:16,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:16,633 INFO L225 Difference]: With dead ends: 1450 [2024-11-11 20:34:16,637 INFO L226 Difference]: Without dead ends: 908 [2024-11-11 20:34:16,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:34:16,640 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 2076 mSDsluCounter, 2600 mSDsCounter, 0 mSdLazyCounter, 5103 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2186 SdHoareTripleChecker+Valid, 3084 SdHoareTripleChecker+Invalid, 5784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 5103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:16,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2186 Valid, 3084 Invalid, 5784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 5103 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-11 20:34:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-11 20:34:16,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 564. [2024-11-11 20:34:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 433 states have (on average 1.6212471131639723) internal successors, (702), 449 states have internal predecessors, (702), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-11 20:34:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 911 transitions. [2024-11-11 20:34:16,835 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 911 transitions. Word has length 106 [2024-11-11 20:34:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:16,835 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 911 transitions. [2024-11-11 20:34:16,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:34:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 911 transitions. [2024-11-11 20:34:16,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-11 20:34:16,841 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:16,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:16,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:34:16,841 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:16,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:16,841 INFO L85 PathProgramCache]: Analyzing trace with hash -878733025, now seen corresponding path program 1 times [2024-11-11 20:34:16,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:16,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904880213] [2024-11-11 20:34:16,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:34:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 20:34:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 20:34:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:34:17,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:34:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:34:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:34:17,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:34:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:34:17,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:17,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904880213] [2024-11-11 20:34:17,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904880213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:17,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:17,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:34:17,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042380089] [2024-11-11 20:34:17,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:17,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:34:17,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:17,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:34:17,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:17,515 INFO L87 Difference]: Start difference. First operand 564 states and 911 transitions. Second operand has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:34:22,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:22,649 INFO L93 Difference]: Finished difference Result 1459 states and 2441 transitions. [2024-11-11 20:34:22,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:34:22,653 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2024-11-11 20:34:22,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:22,662 INFO L225 Difference]: With dead ends: 1459 [2024-11-11 20:34:22,662 INFO L226 Difference]: Without dead ends: 902 [2024-11-11 20:34:22,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-11-11 20:34:22,669 INFO L435 NwaCegarLoop]: 472 mSDtfsCounter, 2109 mSDsluCounter, 2531 mSDsCounter, 0 mSdLazyCounter, 5113 mSolverCounterSat, 682 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2219 SdHoareTripleChecker+Valid, 3003 SdHoareTripleChecker+Invalid, 5795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 682 IncrementalHoareTripleChecker+Valid, 5113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:22,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2219 Valid, 3003 Invalid, 5795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [682 Valid, 5113 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-11 20:34:22,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-11 20:34:22,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 558. [2024-11-11 20:34:22,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 427 states have (on average 1.6276346604215457) internal successors, (695), 443 states have internal predecessors, (695), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-11 20:34:22,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 904 transitions. [2024-11-11 20:34:22,935 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 904 transitions. Word has length 106 [2024-11-11 20:34:22,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:22,936 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 904 transitions. [2024-11-11 20:34:22,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 8.666666666666666) internal successors, (78), 6 states have internal predecessors, (78), 3 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 20:34:22,936 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 904 transitions. [2024-11-11 20:34:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 20:34:22,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:22,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:22,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:34:22,938 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:22,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash 557726952, now seen corresponding path program 1 times [2024-11-11 20:34:22,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:22,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776771614] [2024-11-11 20:34:22,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:34:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:34:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:34:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:34:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:34:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:34:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:34:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:23,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:34:23,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:23,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776771614] [2024-11-11 20:34:23,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776771614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:23,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:23,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:34:23,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515111473] [2024-11-11 20:34:23,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:23,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:34:23,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:23,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:34:23,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:34:23,407 INFO L87 Difference]: Start difference. First operand 558 states and 904 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-11 20:34:31,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:31,040 INFO L93 Difference]: Finished difference Result 2192 states and 3725 transitions. [2024-11-11 20:34:31,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 20:34:31,044 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2024-11-11 20:34:31,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:31,057 INFO L225 Difference]: With dead ends: 2192 [2024-11-11 20:34:31,061 INFO L226 Difference]: Without dead ends: 1652 [2024-11-11 20:34:31,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:34:31,067 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 4284 mSDsluCounter, 2088 mSDsCounter, 0 mSdLazyCounter, 4930 mSolverCounterSat, 1545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4397 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 6475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1545 IncrementalHoareTripleChecker+Valid, 4930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:31,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4397 Valid, 2642 Invalid, 6475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1545 Valid, 4930 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-11 20:34:31,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2024-11-11 20:34:31,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1047. [2024-11-11 20:34:31,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1047 states, 804 states have (on average 1.592039800995025) internal successors, (1280), 834 states have internal predecessors, (1280), 196 states have call successors, (196), 49 states have call predecessors, (196), 46 states have return successors, (201), 187 states have call predecessors, (201), 192 states have call successors, (201) [2024-11-11 20:34:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1677 transitions. [2024-11-11 20:34:31,321 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1677 transitions. Word has length 107 [2024-11-11 20:34:31,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:31,322 INFO L471 AbstractCegarLoop]: Abstraction has 1047 states and 1677 transitions. [2024-11-11 20:34:31,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-11 20:34:31,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1677 transitions. [2024-11-11 20:34:31,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:34:31,324 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:31,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:31,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:34:31,324 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:31,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash 781983570, now seen corresponding path program 1 times [2024-11-11 20:34:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:31,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748445221] [2024-11-11 20:34:31,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:31,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:34:31,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:34:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:34:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:34:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 20:34:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:34:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:34:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:34:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:31,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 20:34:31,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:31,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748445221] [2024-11-11 20:34:31,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748445221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:34:31,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666805284] [2024-11-11 20:34:31,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:31,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:34:31,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:34:31,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:34:31,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:34:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:32,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 1626 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:34:32,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:34:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:32,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:34:32,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666805284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:32,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:34:32,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:34:32,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289833840] [2024-11-11 20:34:32,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:32,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:34:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:32,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:34:32,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:32,168 INFO L87 Difference]: Start difference. First operand 1047 states and 1677 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:34:32,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:32,647 INFO L93 Difference]: Finished difference Result 3013 states and 4909 transitions. [2024-11-11 20:34:32,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:34:32,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2024-11-11 20:34:32,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:32,656 INFO L225 Difference]: With dead ends: 3013 [2024-11-11 20:34:32,656 INFO L226 Difference]: Without dead ends: 1984 [2024-11-11 20:34:32,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:32,660 INFO L435 NwaCegarLoop]: 971 mSDtfsCounter, 827 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1770 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:32,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1770 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:34:32,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1984 states. [2024-11-11 20:34:33,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1984 to 1923. [2024-11-11 20:34:33,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1923 states, 1486 states have (on average 1.6096904441453566) internal successors, (2392), 1546 states have internal predecessors, (2392), 349 states have call successors, (349), 88 states have call predecessors, (349), 87 states have return successors, (372), 336 states have call predecessors, (372), 345 states have call successors, (372) [2024-11-11 20:34:33,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 3113 transitions. [2024-11-11 20:34:33,096 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 3113 transitions. Word has length 113 [2024-11-11 20:34:33,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:33,097 INFO L471 AbstractCegarLoop]: Abstraction has 1923 states and 3113 transitions. [2024-11-11 20:34:33,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:34:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 3113 transitions. [2024-11-11 20:34:33,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:34:33,099 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:33,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:33,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:34:33,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 20:34:33,301 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:33,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:33,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1887158406, now seen corresponding path program 1 times [2024-11-11 20:34:33,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:33,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554744268] [2024-11-11 20:34:33,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:33,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:33,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:34,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:34:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:34:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:34:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:34:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 20:34:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:34:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:34:34,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:34:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 20:34:34,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554744268] [2024-11-11 20:34:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554744268] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:34:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152984073] [2024-11-11 20:34:34,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:34,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:34:34,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:34:34,071 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:34:34,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:34:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:34,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 1627 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:34:34,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:34:34,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 20:34:34,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:34:34,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152984073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:34,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:34:34,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:34:34,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865743967] [2024-11-11 20:34:34,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:34,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:34:34,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:34:34,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:34,471 INFO L87 Difference]: Start difference. First operand 1923 states and 3113 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:34:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:34:35,125 INFO L93 Difference]: Finished difference Result 4317 states and 7042 transitions. [2024-11-11 20:34:35,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:34:35,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2024-11-11 20:34:35,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:34:35,138 INFO L225 Difference]: With dead ends: 4317 [2024-11-11 20:34:35,138 INFO L226 Difference]: Without dead ends: 2412 [2024-11-11 20:34:35,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:34:35,145 INFO L435 NwaCegarLoop]: 904 mSDtfsCounter, 828 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:34:35,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 1699 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:34:35,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2412 states. [2024-11-11 20:34:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2412 to 2356. [2024-11-11 20:34:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 1824 states have (on average 1.6211622807017543) internal successors, (2957), 1899 states have internal predecessors, (2957), 425 states have call successors, (425), 106 states have call predecessors, (425), 106 states have return successors, (452), 411 states have call predecessors, (452), 421 states have call successors, (452) [2024-11-11 20:34:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3834 transitions. [2024-11-11 20:34:35,841 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3834 transitions. Word has length 113 [2024-11-11 20:34:35,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:34:35,842 INFO L471 AbstractCegarLoop]: Abstraction has 2356 states and 3834 transitions. [2024-11-11 20:34:35,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 3 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:34:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3834 transitions. [2024-11-11 20:34:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:34:35,845 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:34:35,845 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:34:35,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:34:36,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-11 20:34:36,046 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:34:36,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:34:36,046 INFO L85 PathProgramCache]: Analyzing trace with hash -918322287, now seen corresponding path program 1 times [2024-11-11 20:34:36,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:34:36,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175106768] [2024-11-11 20:34:36,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:34:36,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:34:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-11 20:34:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-11 20:34:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 20:34:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-11 20:34:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-11 20:34:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:34:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:34:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:34:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-11 20:34:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-11 20:34:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:34:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:34:36,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:34:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-11 20:34:36,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:34:36,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175106768] [2024-11-11 20:34:36,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175106768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:34:36,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:34:36,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:34:36,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646667874] [2024-11-11 20:34:36,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:34:36,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:34:36,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:34:36,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:34:36,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:34:36,600 INFO L87 Difference]: Start difference. First operand 2356 states and 3834 transitions. Second operand has 9 states, 9 states have (on average 9.333333333333334) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14)