./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.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 5c2801af81eeb5fcd439b1a1907444cd22ba07dc03ae6cb195ad73614e32dad5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:47:01,444 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:47:01,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:47:01,525 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:47:01,526 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:47:01,556 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:47:01,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:47:01,557 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:47:01,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:47:01,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:47:01,559 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:47:01,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:47:01,560 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:47:01,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:47:01,561 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:47:01,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:47:01,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:47:01,563 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:47:01,566 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:47:01,567 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:47:01,567 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:47:01,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:47:01,569 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:47:01,569 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:47:01,569 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:47:01,569 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:47:01,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:47:01,570 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:47:01,570 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:47:01,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:47:01,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:47:01,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:47:01,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:47:01,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:47:01,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:47:01,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:47:01,572 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:47:01,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:47:01,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:47:01,572 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:47:01,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:47:01,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:47:01,574 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 -> 5c2801af81eeb5fcd439b1a1907444cd22ba07dc03ae6cb195ad73614e32dad5 [2024-10-14 02:47:01,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:47:01,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:47:01,910 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:47:01,911 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:47:01,912 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:47:01,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c [2024-10-14 02:47:03,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:47:03,695 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:47:03,695 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c [2024-10-14 02:47:03,713 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebf1fdf8/f18dab74294c4444aaee644bab9b2839/FLAG3cc955d2f [2024-10-14 02:47:03,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ebf1fdf8/f18dab74294c4444aaee644bab9b2839 [2024-10-14 02:47:03,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:47:03,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:47:03,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:47:03,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:47:03,737 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:47:03,738 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:47:03" (1/1) ... [2024-10-14 02:47:03,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@499a29c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:03, skipping insertion in model container [2024-10-14 02:47:03,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:47:03" (1/1) ... [2024-10-14 02:47:03,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:47:04,291 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c[62420,62433] [2024-10-14 02:47:04,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:47:04,344 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:47:04,353 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-10-14 02:47:04,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [408] [2024-10-14 02:47:04,355 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [528] [2024-10-14 02:47:04,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [622] [2024-10-14 02:47:04,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2141] [2024-10-14 02:47:04,356 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2802] [2024-10-14 02:47:04,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [2817] [2024-10-14 02:47:04,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3004] [2024-10-14 02:47:04,357 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [3013] [2024-10-14 02:47:04,358 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3379] [2024-10-14 02:47:04,422 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec3_product21.cil.c[62420,62433] [2024-10-14 02:47:04,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:47:04,467 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:47:04,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04 WrapperNode [2024-10-14 02:47:04,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:47:04,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:47:04,469 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:47:04,469 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:47:04,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,557 INFO L138 Inliner]: procedures = 90, calls = 345, calls flagged for inlining = 24, calls inlined = 21, statements flattened = 883 [2024-10-14 02:47:04,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:47:04,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:47:04,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:47:04,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:47:04,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,578 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,610 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4, 4, 4, 4, 2]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-14 02:47:04,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,676 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:47:04,676 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:47:04,677 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:47:04,677 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:47:04,677 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (1/1) ... [2024-10-14 02:47:04,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:47:04,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:47:04,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:47:04,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:47:04,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:47:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2024-10-14 02:47:04,813 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2024-10-14 02:47:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:47:04,813 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:47:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:47:04,813 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:47:04,814 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:47:04,814 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:47:04,815 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-14 02:47:04,815 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-14 02:47:04,815 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:47:04,815 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:47:04,815 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:47:04,815 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:47:04,815 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:47:04,815 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:47:04,816 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-14 02:47:04,816 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-14 02:47:04,816 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:47:04,816 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:47:04,816 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:47:04,816 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:47:04,816 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:47:04,816 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:47:04,816 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:47:04,816 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:47:04,816 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2024-10-14 02:47:04,816 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2024-10-14 02:47:04,817 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:47:04,817 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:47:04,817 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2024-10-14 02:47:04,817 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2024-10-14 02:47:04,817 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:47:04,817 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:47:04,817 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:47:04,817 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:47:04,817 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:47:04,817 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:47:04,817 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:47:04,817 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:47:04,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:47:04,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:47:04,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:47:04,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:47:04,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:47:04,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:47:04,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:47:04,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:47:04,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:47:04,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:47:04,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:47:04,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:47:04,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:47:04,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:47:04,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:47:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:47:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:47:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:47:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:47:04,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:47:04,824 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-14 02:47:04,824 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-14 02:47:04,825 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:47:04,825 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:47:04,825 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:47:04,825 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:47:04,825 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:47:04,825 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:47:04,825 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2024-10-14 02:47:04,825 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2024-10-14 02:47:04,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:47:04,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:47:04,826 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:47:04,826 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:47:05,019 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:47:05,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:47:06,302 INFO L? ?]: Removed 458 outVars from TransFormulas that were not future-live. [2024-10-14 02:47:06,302 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:47:06,395 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:47:06,395 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:47:06,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:47:06 BoogieIcfgContainer [2024-10-14 02:47:06,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:47:06,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:47:06,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:47:06,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:47:06,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:47:03" (1/3) ... [2024-10-14 02:47:06,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c1e24e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:47:06, skipping insertion in model container [2024-10-14 02:47:06,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:47:04" (2/3) ... [2024-10-14 02:47:06,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c1e24e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:47:06, skipping insertion in model container [2024-10-14 02:47:06,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:47:06" (3/3) ... [2024-10-14 02:47:06,411 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product21.cil.c [2024-10-14 02:47:06,428 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:47:06,428 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:47:06,516 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:47:06,524 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;@79c60ff9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:47:06,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:47:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 567 states, 433 states have (on average 1.7090069284064666) internal successors, (740), 451 states have internal predecessors, (740), 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-10-14 02:47:06,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 02:47:06,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:06,578 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:47:06,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:06,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:06,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1963638961, now seen corresponding path program 1 times [2024-10-14 02:47:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:06,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977084871] [2024-10-14 02:47:06,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:06,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:07,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:07,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:07,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:47:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:07,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:08,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:47:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:08,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:47:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:08,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:47:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:08,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 02:47:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:08,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 02:47:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:47:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:08,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:47:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:08,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:47:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:47:08,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:08,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977084871] [2024-10-14 02:47:08,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977084871] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:47:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739376929] [2024-10-14 02:47:08,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:08,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:47:08,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:08,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:47:08,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:47:08,163 INFO L87 Difference]: Start difference. First operand has 567 states, 433 states have (on average 1.7090069284064666) internal successors, (740), 451 states have internal predecessors, (740), 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 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 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-10-14 02:47:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:16,537 INFO L93 Difference]: Finished difference Result 1472 states and 2579 transitions. [2024-10-14 02:47:16,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:47:16,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (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 89 [2024-10-14 02:47:16,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:16,566 INFO L225 Difference]: With dead ends: 1472 [2024-10-14 02:47:16,567 INFO L226 Difference]: Without dead ends: 902 [2024-10-14 02:47:16,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-14 02:47:16,585 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 1130 mSDsluCounter, 2632 mSDsCounter, 0 mSdLazyCounter, 5715 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1242 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 5990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 5715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:16,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1242 Valid, 3112 Invalid, 5990 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [275 Valid, 5715 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-10-14 02:47:16,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-14 02:47:16,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 573. [2024-10-14 02:47:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 439 states have (on average 1.6947608200455582) internal successors, (744), 457 states have internal predecessors, (744), 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-10-14 02:47:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 957 transitions. [2024-10-14 02:47:16,892 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 957 transitions. Word has length 89 [2024-10-14 02:47:16,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:16,894 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 957 transitions. [2024-10-14 02:47:16,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (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-10-14 02:47:16,894 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 957 transitions. [2024-10-14 02:47:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 02:47:16,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:16,904 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:47:16,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:47:16,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:16,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:16,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1041295001, now seen corresponding path program 1 times [2024-10-14 02:47:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:16,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149472712] [2024-10-14 02:47:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:16,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:47:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:47:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:47:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:47:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:47:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 02:47:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:47:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:47:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:47:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:17,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:47:17,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:17,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149472712] [2024-10-14 02:47:17,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149472712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:17,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:17,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:47:17,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426780484] [2024-10-14 02:47:17,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:17,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:47:17,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:17,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:47:17,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:47:17,828 INFO L87 Difference]: Start difference. First operand 573 states and 957 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (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-10-14 02:47:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:24,284 INFO L93 Difference]: Finished difference Result 1465 states and 2528 transitions. [2024-10-14 02:47:24,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:47:24,285 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (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 90 [2024-10-14 02:47:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:24,294 INFO L225 Difference]: With dead ends: 1465 [2024-10-14 02:47:24,295 INFO L226 Difference]: Without dead ends: 902 [2024-10-14 02:47:24,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:47:24,299 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 2206 mSDsluCounter, 2318 mSDsCounter, 0 mSdLazyCounter, 5381 mSolverCounterSat, 697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2318 SdHoareTripleChecker+Valid, 2755 SdHoareTripleChecker+Invalid, 6078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 697 IncrementalHoareTripleChecker+Valid, 5381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:24,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2318 Valid, 2755 Invalid, 6078 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [697 Valid, 5381 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-14 02:47:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-10-14 02:47:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 573. [2024-10-14 02:47:24,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 439 states have (on average 1.6924829157175398) internal successors, (743), 457 states have internal predecessors, (743), 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-10-14 02:47:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 956 transitions. [2024-10-14 02:47:24,439 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 956 transitions. Word has length 90 [2024-10-14 02:47:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:24,440 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 956 transitions. [2024-10-14 02:47:24,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (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-10-14 02:47:24,440 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 956 transitions. [2024-10-14 02:47:24,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 02:47:24,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:24,443 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:47:24,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:47:24,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:24,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:24,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1763470675, now seen corresponding path program 1 times [2024-10-14 02:47:24,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:24,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565472063] [2024-10-14 02:47:24,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:24,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:24,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:47:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:47:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:47:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:47:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:47:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 02:47:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:47:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:47:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:47:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:47:24,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:24,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565472063] [2024-10-14 02:47:24,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565472063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:24,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:47:24,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555907870] [2024-10-14 02:47:24,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:24,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:47:24,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:24,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:47:24,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:47:24,975 INFO L87 Difference]: Start difference. First operand 573 states and 956 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 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-10-14 02:47:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:30,147 INFO L93 Difference]: Finished difference Result 1459 states and 2511 transitions. [2024-10-14 02:47:30,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:47:30,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 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 90 [2024-10-14 02:47:30,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:30,154 INFO L225 Difference]: With dead ends: 1459 [2024-10-14 02:47:30,154 INFO L226 Difference]: Without dead ends: 867 [2024-10-14 02:47:30,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:47:30,158 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 1032 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 3378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:30,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 1557 Invalid, 3378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 3108 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 02:47:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-10-14 02:47:30,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 550. [2024-10-14 02:47:30,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 419 states have (on average 1.6825775656324582) internal successors, (705), 435 states have internal predecessors, (705), 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-10-14 02:47:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 914 transitions. [2024-10-14 02:47:30,327 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 914 transitions. Word has length 90 [2024-10-14 02:47:30,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:30,328 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 914 transitions. [2024-10-14 02:47:30,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 4 states have internal predecessors, (63), 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-10-14 02:47:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 914 transitions. [2024-10-14 02:47:30,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 02:47:30,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:30,332 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:47:30,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:47:30,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:30,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash -980477251, now seen corresponding path program 1 times [2024-10-14 02:47:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239491089] [2024-10-14 02:47:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:30,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:47:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:47:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:47:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:47:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:47:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 02:47:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:30,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:47:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:31,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:47:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:31,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 02:47:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:47:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:31,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239491089] [2024-10-14 02:47:31,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239491089] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:31,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:31,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:47:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422712869] [2024-10-14 02:47:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:31,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:47:31,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:31,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:47:31,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:47:31,025 INFO L87 Difference]: Start difference. First operand 550 states and 914 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (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-10-14 02:47:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:37,366 INFO L93 Difference]: Finished difference Result 1423 states and 2443 transitions. [2024-10-14 02:47:37,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:47:37,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (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 91 [2024-10-14 02:47:37,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:37,373 INFO L225 Difference]: With dead ends: 1423 [2024-10-14 02:47:37,373 INFO L226 Difference]: Without dead ends: 861 [2024-10-14 02:47:37,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-14 02:47:37,380 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 1086 mSDsluCounter, 2406 mSDsCounter, 0 mSdLazyCounter, 5479 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 2847 SdHoareTripleChecker+Invalid, 5751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 5479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:37,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 2847 Invalid, 5751 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [272 Valid, 5479 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-14 02:47:37,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-14 02:47:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 544. [2024-10-14 02:47:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 413 states have (on average 1.675544794188862) internal successors, (692), 429 states have internal predecessors, (692), 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-10-14 02:47:37,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 901 transitions. [2024-10-14 02:47:37,544 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 901 transitions. Word has length 91 [2024-10-14 02:47:37,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:37,545 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 901 transitions. [2024-10-14 02:47:37,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 6 states have internal predecessors, (64), 3 states have call successors, (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-10-14 02:47:37,545 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 901 transitions. [2024-10-14 02:47:37,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 02:47:37,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:37,550 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:47:37,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:47:37,551 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:37,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1783477327, now seen corresponding path program 1 times [2024-10-14 02:47:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385969926] [2024-10-14 02:47:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:37,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:37,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:47:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:47:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:47:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:47:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:47:38,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 02:47:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:47:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:47:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 02:47:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:38,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:47:38,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:38,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385969926] [2024-10-14 02:47:38,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385969926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:38,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:38,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:47:38,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284167944] [2024-10-14 02:47:38,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:38,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:47:38,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:38,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:47:38,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:47:38,156 INFO L87 Difference]: Start difference. First operand 544 states and 901 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 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-10-14 02:47:42,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:42,679 INFO L93 Difference]: Finished difference Result 1395 states and 2394 transitions. [2024-10-14 02:47:42,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:47:42,679 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 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 92 [2024-10-14 02:47:42,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:42,685 INFO L225 Difference]: With dead ends: 1395 [2024-10-14 02:47:42,685 INFO L226 Difference]: Without dead ends: 861 [2024-10-14 02:47:42,688 INFO L431 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-10-14 02:47:42,689 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 1569 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 2748 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 3236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 2748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:42,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 1509 Invalid, 3236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 2748 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-10-14 02:47:42,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-14 02:47:42,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 544. [2024-10-14 02:47:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 413 states have (on average 1.6731234866828086) internal successors, (691), 429 states have internal predecessors, (691), 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-10-14 02:47:42,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 900 transitions. [2024-10-14 02:47:42,802 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 900 transitions. Word has length 92 [2024-10-14 02:47:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:42,802 INFO L471 AbstractCegarLoop]: Abstraction has 544 states and 900 transitions. [2024-10-14 02:47:42,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 4 states have internal predecessors, (65), 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-10-14 02:47:42,803 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 900 transitions. [2024-10-14 02:47:42,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 02:47:42,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:42,805 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:47:42,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:47:42,806 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:42,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:42,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1942701978, now seen corresponding path program 1 times [2024-10-14 02:47:42,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:42,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144072991] [2024-10-14 02:47:42,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:42,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:47:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:47:43,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:47:43,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:47:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:47:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 02:47:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:47:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:47:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:47:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:43,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:47:43,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:43,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144072991] [2024-10-14 02:47:43,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144072991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:43,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:43,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:47:43,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051414885] [2024-10-14 02:47:43,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:43,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:47:43,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:43,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:47:43,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:47:43,400 INFO L87 Difference]: Start difference. First operand 544 states and 900 transitions. Second operand has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (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-10-14 02:47:49,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:49,468 INFO L93 Difference]: Finished difference Result 1411 states and 2412 transitions. [2024-10-14 02:47:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:47:49,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (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 93 [2024-10-14 02:47:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:49,474 INFO L225 Difference]: With dead ends: 1411 [2024-10-14 02:47:49,474 INFO L226 Difference]: Without dead ends: 855 [2024-10-14 02:47:49,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-14 02:47:49,478 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 1586 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 5280 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1696 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 5756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 5280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:49,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1696 Valid, 2785 Invalid, 5756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 5280 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-10-14 02:47:49,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-14 02:47:49,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 538. [2024-10-14 02:47:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 407 states have (on average 1.6658476658476657) internal successors, (678), 423 states have internal predecessors, (678), 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-10-14 02:47:49,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 887 transitions. [2024-10-14 02:47:49,619 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 887 transitions. Word has length 93 [2024-10-14 02:47:49,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:49,620 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 887 transitions. [2024-10-14 02:47:49,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.333333333333333) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (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-10-14 02:47:49,620 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 887 transitions. [2024-10-14 02:47:49,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 02:47:49,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:49,623 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:47:49,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:47:49,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:49,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:49,623 INFO L85 PathProgramCache]: Analyzing trace with hash 844398929, now seen corresponding path program 1 times [2024-10-14 02:47:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:49,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166116414] [2024-10-14 02:47:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:49,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:49,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:47:50,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:47:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:47:50,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 02:47:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:47:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:47:50,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:47:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 02:47:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:47:50,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:47:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166116414] [2024-10-14 02:47:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166116414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:50,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:50,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 02:47:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443752022] [2024-10-14 02:47:50,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:50,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:47:50,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:50,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:47:50,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:47:50,212 INFO L87 Difference]: Start difference. First operand 538 states and 887 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 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-10-14 02:47:54,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:47:54,638 INFO L93 Difference]: Finished difference Result 1383 states and 2365 transitions. [2024-10-14 02:47:54,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:47:54,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 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 94 [2024-10-14 02:47:54,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:47:54,644 INFO L225 Difference]: With dead ends: 1383 [2024-10-14 02:47:54,644 INFO L226 Difference]: Without dead ends: 855 [2024-10-14 02:47:54,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:47:54,647 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 999 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:47:54,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 1578 Invalid, 3102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-14 02:47:54,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-14 02:47:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 538. [2024-10-14 02:47:54,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 407 states have (on average 1.6633906633906634) internal successors, (677), 423 states have internal predecessors, (677), 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-10-14 02:47:54,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 886 transitions. [2024-10-14 02:47:54,789 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 886 transitions. Word has length 94 [2024-10-14 02:47:54,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:47:54,789 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 886 transitions. [2024-10-14 02:47:54,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 4 states have internal predecessors, (67), 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-10-14 02:47:54,790 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 886 transitions. [2024-10-14 02:47:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 02:47:54,792 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:47:54,792 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:47:54,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:47:54,792 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:47:54,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:47:54,793 INFO L85 PathProgramCache]: Analyzing trace with hash -144341603, now seen corresponding path program 1 times [2024-10-14 02:47:54,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:47:54,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001880879] [2024-10-14 02:47:54,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:47:54,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:47:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:47:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:47:55,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:47:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:47:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:47:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 02:47:55,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:47:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:47:55,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:47:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:47:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:47:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:47:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:47:55,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:47:55,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001880879] [2024-10-14 02:47:55,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001880879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:47:55,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:47:55,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:47:55,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41534849] [2024-10-14 02:47:55,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:47:55,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:47:55,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:47:55,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:47:55,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:47:55,388 INFO L87 Difference]: Start difference. First operand 538 states and 886 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 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-10-14 02:48:01,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:01,049 INFO L93 Difference]: Finished difference Result 1393 states and 2374 transitions. [2024-10-14 02:48:01,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:48:01,049 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 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 95 [2024-10-14 02:48:01,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:01,055 INFO L225 Difference]: With dead ends: 1393 [2024-10-14 02:48:01,055 INFO L226 Difference]: Without dead ends: 865 [2024-10-14 02:48:01,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:48:01,058 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 1515 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 5164 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 5634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 5164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:01,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 2703 Invalid, 5634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 5164 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 02:48:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2024-10-14 02:48:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 543. [2024-10-14 02:48:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 412 states have (on average 1.6553398058252426) internal successors, (682), 428 states have internal predecessors, (682), 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-10-14 02:48:01,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 891 transitions. [2024-10-14 02:48:01,194 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 891 transitions. Word has length 95 [2024-10-14 02:48:01,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:01,194 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 891 transitions. [2024-10-14 02:48:01,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 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-10-14 02:48:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 891 transitions. [2024-10-14 02:48:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 02:48:01,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:01,198 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:48:01,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:48:01,199 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:01,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:01,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1214636802, now seen corresponding path program 1 times [2024-10-14 02:48:01,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:01,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528439595] [2024-10-14 02:48:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:01,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:48:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 02:48:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:48:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:48:01,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:48:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:48:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:48:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:01,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:01,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:01,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528439595] [2024-10-14 02:48:01,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528439595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:01,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:48:01,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296555716] [2024-10-14 02:48:01,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:01,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:48:01,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:01,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:48:01,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:48:01,827 INFO L87 Difference]: Start difference. First operand 543 states and 891 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 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-10-14 02:48:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:07,627 INFO L93 Difference]: Finished difference Result 1404 states and 2384 transitions. [2024-10-14 02:48:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 02:48:07,627 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 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 95 [2024-10-14 02:48:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:07,633 INFO L225 Difference]: With dead ends: 1404 [2024-10-14 02:48:07,633 INFO L226 Difference]: Without dead ends: 849 [2024-10-14 02:48:07,636 INFO L431 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-10-14 02:48:07,637 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 1037 mSDsluCounter, 2276 mSDsCounter, 0 mSdLazyCounter, 5186 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 2692 SdHoareTripleChecker+Invalid, 5466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 5186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:07,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 2692 Invalid, 5466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 5186 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-14 02:48:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-14 02:48:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 532. [2024-10-14 02:48:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 401 states have (on average 1.653366583541147) internal successors, (663), 417 states have internal predecessors, (663), 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-10-14 02:48:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 872 transitions. [2024-10-14 02:48:07,773 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 872 transitions. Word has length 95 [2024-10-14 02:48:07,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:07,773 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 872 transitions. [2024-10-14 02:48:07,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 6 states have internal predecessors, (68), 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-10-14 02:48:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 872 transitions. [2024-10-14 02:48:07,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 02:48:07,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:07,776 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:48:07,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:48:07,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:07,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:07,776 INFO L85 PathProgramCache]: Analyzing trace with hash 524055958, now seen corresponding path program 1 times [2024-10-14 02:48:07,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:07,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159547561] [2024-10-14 02:48:07,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:07,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:48:08,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:48:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:48:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:48:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:48:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:48:08,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:48:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:08,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:08,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:08,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159547561] [2024-10-14 02:48:08,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159547561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:08,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:08,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:48:08,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677092386] [2024-10-14 02:48:08,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:08,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:48:08,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:08,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:48:08,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:48:08,332 INFO L87 Difference]: Start difference. First operand 532 states and 872 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 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-10-14 02:48:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:13,877 INFO L93 Difference]: Finished difference Result 1377 states and 2340 transitions. [2024-10-14 02:48:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:48:13,877 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 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 96 [2024-10-14 02:48:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:13,881 INFO L225 Difference]: With dead ends: 1377 [2024-10-14 02:48:13,881 INFO L226 Difference]: Without dead ends: 855 [2024-10-14 02:48:13,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-10-14 02:48:13,884 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 1499 mSDsluCounter, 2339 mSDsCounter, 0 mSdLazyCounter, 4916 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1609 SdHoareTripleChecker+Valid, 2773 SdHoareTripleChecker+Invalid, 5411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 4916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:13,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1609 Valid, 2773 Invalid, 5411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 4916 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 02:48:13,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-14 02:48:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 538. [2024-10-14 02:48:14,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 407 states have (on average 1.6437346437346438) internal successors, (669), 423 states have internal predecessors, (669), 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-10-14 02:48:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 878 transitions. [2024-10-14 02:48:14,023 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 878 transitions. Word has length 96 [2024-10-14 02:48:14,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:14,023 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 878 transitions. [2024-10-14 02:48:14,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 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-10-14 02:48:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 878 transitions. [2024-10-14 02:48:14,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 02:48:14,025 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:14,026 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:48:14,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:48:14,026 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:14,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash -692097768, now seen corresponding path program 1 times [2024-10-14 02:48:14,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:14,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172524869] [2024-10-14 02:48:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:14,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:48:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:48:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:48:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:48:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:48:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:48:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:48:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:14,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:14,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:14,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172524869] [2024-10-14 02:48:14,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172524869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:14,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:14,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:48:14,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376184991] [2024-10-14 02:48:14,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:14,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:48:14,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:14,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:48:14,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:48:14,547 INFO L87 Difference]: Start difference. First operand 538 states and 878 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 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-10-14 02:48:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:48:20,549 INFO L93 Difference]: Finished difference Result 1385 states and 2346 transitions. [2024-10-14 02:48:20,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 02:48:20,550 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 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 96 [2024-10-14 02:48:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:48:20,555 INFO L225 Difference]: With dead ends: 1385 [2024-10-14 02:48:20,555 INFO L226 Difference]: Without dead ends: 849 [2024-10-14 02:48:20,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:48:20,558 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 1477 mSDsluCounter, 2434 mSDsCounter, 0 mSdLazyCounter, 5089 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1587 SdHoareTripleChecker+Valid, 2886 SdHoareTripleChecker+Invalid, 5558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 5089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:48:20,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1587 Valid, 2886 Invalid, 5558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 5089 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 02:48:20,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-10-14 02:48:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 532. [2024-10-14 02:48:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 401 states have (on average 1.6508728179551122) internal successors, (662), 417 states have internal predecessors, (662), 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-10-14 02:48:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 871 transitions. [2024-10-14 02:48:20,689 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 871 transitions. Word has length 96 [2024-10-14 02:48:20,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:48:20,689 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 871 transitions. [2024-10-14 02:48:20,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 6 states have internal predecessors, (69), 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-10-14 02:48:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 871 transitions. [2024-10-14 02:48:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 02:48:20,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:48:20,692 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:48:20,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:48:20,692 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:48:20,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:48:20,693 INFO L85 PathProgramCache]: Analyzing trace with hash -876158845, now seen corresponding path program 1 times [2024-10-14 02:48:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:48:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336165199] [2024-10-14 02:48:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:48:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:48:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:48:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:48:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:48:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:48:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:48:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:48:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:48:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 02:48:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-14 02:48:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:48:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:48:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:48:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:48:21,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:48:21,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336165199] [2024-10-14 02:48:21,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336165199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:48:21,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:48:21,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:48:21,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081699602] [2024-10-14 02:48:21,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:48:21,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:48:21,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:48:21,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:48:21,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:48:21,232 INFO L87 Difference]: Start difference. First operand 532 states and 871 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 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)