/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:38:38,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:38:38,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 22:38:38,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:38:38,856 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:38:38,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:38:38,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:38:38,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:38:38,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:38:38,882 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:38:38,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:38:38,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:38:38,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:38:38,883 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:38:38,883 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:38:38,884 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:38:38,884 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:38:38,884 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:38:38,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:38:38,884 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:38:38,884 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:38:38,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:38:38,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:38:38,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:38:38,885 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:38:38,885 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:38:38,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:38:38,885 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:38:38,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:38:38,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:38:38,887 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:38:38,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:38:38,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:38:38,887 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:38:38,887 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:38:38,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:38:38,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:38:38,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:38:38,887 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:38:38,888 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:38:38,888 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:38:38,888 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:38:38,888 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:38:38,888 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: Use bitabs translation -> true [2023-12-15 22:38:39,086 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:38:39,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:38:39,101 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:38:39,102 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:38:39,102 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:38:39,103 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product11.cil.c [2023-12-15 22:38:40,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:38:40,435 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:38:40,435 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product11.cil.c [2023-12-15 22:38:40,453 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ce57187/339a5a5ec899405ab97d6895c19d67af/FLAG940576fde [2023-12-15 22:38:40,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87ce57187/339a5a5ec899405ab97d6895c19d67af [2023-12-15 22:38:40,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:38:40,465 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:38:40,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:38:40,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:38:40,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:38:40,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:38:40" (1/1) ... [2023-12-15 22:38:40,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a7c16da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:40, skipping insertion in model container [2023-12-15 22:38:40,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:38:40" (1/1) ... [2023-12-15 22:38:40,521 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:38:40,634 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product11.cil.c[1545,1558] [2023-12-15 22:38:40,899 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:38:40,912 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:38:40,918 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2023-12-15 22:38:40,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [57] [2023-12-15 22:38:40,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [423] [2023-12-15 22:38:40,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [523] [2023-12-15 22:38:40,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [643] [2023-12-15 22:38:40,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [832] [2023-12-15 22:38:40,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1185] [2023-12-15 22:38:40,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1200] [2023-12-15 22:38:40,919 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2726] [2023-12-15 22:38:40,920 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3387] [2023-12-15 22:38:40,921 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product11.cil.c[1545,1558] [2023-12-15 22:38:41,060 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:38:41,080 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:38:41,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41 WrapperNode [2023-12-15 22:38:41,081 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:38:41,082 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:38:41,082 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:38:41,082 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:38:41,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,143 INFO L138 Inliner]: procedures = 91, calls = 344, calls flagged for inlining = 23, calls inlined = 20, statements flattened = 1100 [2023-12-15 22:38:41,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:38:41,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:38:41,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:38:41,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:38:41,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,214 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2023-12-15 22:38:41,214 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,226 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,243 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,250 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:38:41,250 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:38:41,250 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:38:41,250 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:38:41,251 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (1/1) ... [2023-12-15 22:38:41,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:38:41,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:38:41,302 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) [2023-12-15 22:38:41,321 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 [2023-12-15 22:38:41,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:38:41,328 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2023-12-15 22:38:41,328 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2023-12-15 22:38:41,328 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2023-12-15 22:38:41,328 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2023-12-15 22:38:41,328 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2023-12-15 22:38:41,328 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2023-12-15 22:38:41,328 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2023-12-15 22:38:41,328 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2023-12-15 22:38:41,328 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2023-12-15 22:38:41,328 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2023-12-15 22:38:41,328 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2023-12-15 22:38:41,329 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2023-12-15 22:38:41,329 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2023-12-15 22:38:41,329 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2023-12-15 22:38:41,329 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2023-12-15 22:38:41,329 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2023-12-15 22:38:41,330 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2023-12-15 22:38:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2023-12-15 22:38:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2023-12-15 22:38:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2023-12-15 22:38:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2023-12-15 22:38:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2023-12-15 22:38:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2023-12-15 22:38:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2023-12-15 22:38:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2023-12-15 22:38:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2023-12-15 22:38:41,332 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2023-12-15 22:38:41,332 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2023-12-15 22:38:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2023-12-15 22:38:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2023-12-15 22:38:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2023-12-15 22:38:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2023-12-15 22:38:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2023-12-15 22:38:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2023-12-15 22:38:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2023-12-15 22:38:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2023-12-15 22:38:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2023-12-15 22:38:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2023-12-15 22:38:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2023-12-15 22:38:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2023-12-15 22:38:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2023-12-15 22:38:41,333 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2023-12-15 22:38:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:38:41,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-12-15 22:38:41,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2023-12-15 22:38:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2023-12-15 22:38:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2023-12-15 22:38:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2023-12-15 22:38:41,335 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2023-12-15 22:38:41,335 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2023-12-15 22:38:41,336 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2023-12-15 22:38:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2023-12-15 22:38:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2023-12-15 22:38:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2023-12-15 22:38:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2023-12-15 22:38:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2023-12-15 22:38:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:38:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:38:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2023-12-15 22:38:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2023-12-15 22:38:41,487 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:38:41,488 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:38:42,194 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:38:42,257 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:38:42,257 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 22:38:42,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:38:42 BoogieIcfgContainer [2023-12-15 22:38:42,258 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:38:42,259 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:38:42,259 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:38:42,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:38:42,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:38:40" (1/3) ... [2023-12-15 22:38:42,262 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c5c7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:38:42, skipping insertion in model container [2023-12-15 22:38:42,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:38:41" (2/3) ... [2023-12-15 22:38:42,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51c5c7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:38:42, skipping insertion in model container [2023-12-15 22:38:42,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:38:42" (3/3) ... [2023-12-15 22:38:42,264 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product11.cil.c [2023-12-15 22:38:42,275 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:38:42,276 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:38:42,336 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:38:42,340 INFO L357 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, mHoare=true, 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;@6c17434f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:38:42,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:38:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 563 states, 429 states have (on average 1.7062937062937062) internal successors, (732), 447 states have internal predecessors, (732), 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) [2023-12-15 22:38:42,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-15 22:38:42,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:38:42,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:38:42,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:38:42,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:38:42,381 INFO L85 PathProgramCache]: Analyzing trace with hash -809565727, now seen corresponding path program 1 times [2023-12-15 22:38:42,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:38:42,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335285184] [2023-12-15 22:38:42,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:38:42,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:38:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:38:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:38:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:38:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 22:38:43,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 22:38:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 22:38:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 22:38:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:38:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 22:38:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 22:38:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:38:43,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:38:43,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335285184] [2023-12-15 22:38:43,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335285184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:38:43,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:38:43,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 22:38:43,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133791477] [2023-12-15 22:38:43,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:38:43,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 22:38:43,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:38:43,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 22:38:43,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:38:43,561 INFO L87 Difference]: Start difference. First operand has 563 states, 429 states have (on average 1.7062937062937062) internal successors, (732), 447 states have internal predecessors, (732), 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.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 22:38:50,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:38:50,024 INFO L93 Difference]: Finished difference Result 1469 states and 2573 transitions. [2023-12-15 22:38:50,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 22:38:50,027 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 100 [2023-12-15 22:38:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:38:50,051 INFO L225 Difference]: With dead ends: 1469 [2023-12-15 22:38:50,051 INFO L226 Difference]: Without dead ends: 903 [2023-12-15 22:38:50,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-12-15 22:38:50,062 INFO L413 NwaCegarLoop]: 476 mSDtfsCounter, 2211 mSDsluCounter, 2529 mSDsCounter, 0 mSdLazyCounter, 5559 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2322 SdHoareTripleChecker+Valid, 3005 SdHoareTripleChecker+Invalid, 6186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 5559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-15 22:38:50,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2322 Valid, 3005 Invalid, 6186 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [627 Valid, 5559 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2023-12-15 22:38:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2023-12-15 22:38:50,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 569. [2023-12-15 22:38:50,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 435 states have (on average 1.6919540229885057) internal successors, (736), 453 states have internal predecessors, (736), 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) [2023-12-15 22:38:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 949 transitions. [2023-12-15 22:38:50,243 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 949 transitions. Word has length 100 [2023-12-15 22:38:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:38:50,244 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 949 transitions. [2023-12-15 22:38:50,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 6 states have internal predecessors, (61), 3 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 22:38:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 949 transitions. [2023-12-15 22:38:50,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 22:38:50,249 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:38:50,249 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:38:50,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 22:38:50,250 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:38:50,250 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:38:50,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1465974353, now seen corresponding path program 1 times [2023-12-15 22:38:50,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:38:50,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559955298] [2023-12-15 22:38:50,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:38:50,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:38:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:38:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:50,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:38:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:38:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 22:38:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 22:38:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 22:38:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 22:38:50,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 22:38:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:50,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 22:38:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 22:38:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:38:50,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:38:50,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559955298] [2023-12-15 22:38:50,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559955298] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:38:50,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:38:50,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:38:50,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915097827] [2023-12-15 22:38:50,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:38:50,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:38:50,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:38:50,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:38:50,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:38:50,842 INFO L87 Difference]: Start difference. First operand 569 states and 949 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:38:55,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:38:55,594 INFO L93 Difference]: Finished difference Result 1459 states and 2517 transitions. [2023-12-15 22:38:55,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 22:38:55,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 101 [2023-12-15 22:38:55,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:38:55,599 INFO L225 Difference]: With dead ends: 1459 [2023-12-15 22:38:55,599 INFO L226 Difference]: Without dead ends: 900 [2023-12-15 22:38:55,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-12-15 22:38:55,602 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 2180 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 640 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2290 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 640 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-15 22:38:55,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2290 Valid, 1478 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [640 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-15 22:38:55,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2023-12-15 22:38:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 569. [2023-12-15 22:38:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 435 states have (on average 1.6896551724137931) internal successors, (735), 453 states have internal predecessors, (735), 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) [2023-12-15 22:38:55,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 948 transitions. [2023-12-15 22:38:55,686 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 948 transitions. Word has length 101 [2023-12-15 22:38:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:38:55,686 INFO L495 AbstractCegarLoop]: Abstraction has 569 states and 948 transitions. [2023-12-15 22:38:55,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:38:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 948 transitions. [2023-12-15 22:38:55,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 22:38:55,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:38:55,689 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:38:55,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 22:38:55,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:38:55,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:38:55,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1352479237, now seen corresponding path program 1 times [2023-12-15 22:38:55,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:38:55,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797075503] [2023-12-15 22:38:55,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:38:55,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:38:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:55,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:38:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:38:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:38:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 22:38:56,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 22:38:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 22:38:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 22:38:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 22:38:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:56,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:38:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 22:38:56,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 22:38:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:38:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:38:56,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:38:56,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797075503] [2023-12-15 22:38:56,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797075503] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:38:56,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:38:56,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:38:56,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337627397] [2023-12-15 22:38:56,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:38:56,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:38:56,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:38:56,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:38:56,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:38:56,143 INFO L87 Difference]: Start difference. First operand 569 states and 948 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:39:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:39:00,570 INFO L93 Difference]: Finished difference Result 1456 states and 2505 transitions. [2023-12-15 22:39:00,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:39:00,571 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 101 [2023-12-15 22:39:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:39:00,576 INFO L225 Difference]: With dead ends: 1456 [2023-12-15 22:39:00,576 INFO L226 Difference]: Without dead ends: 868 [2023-12-15 22:39:00,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:39:00,582 INFO L413 NwaCegarLoop]: 429 mSDtfsCounter, 1579 mSDsluCounter, 1080 mSDsCounter, 0 mSdLazyCounter, 3061 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 3500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 3061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-12-15 22:39:00,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 1509 Invalid, 3500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 3061 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-12-15 22:39:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2023-12-15 22:39:00,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 546. [2023-12-15 22:39:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 415 states have (on average 1.6795180722891567) internal successors, (697), 431 states have internal predecessors, (697), 106 states have call successors, (106), 26 states have call predecessors, (106), 24 states have return successors, (103), 101 states have call predecessors, (103), 103 states have call successors, (103) [2023-12-15 22:39:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 906 transitions. [2023-12-15 22:39:00,687 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 906 transitions. Word has length 101 [2023-12-15 22:39:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:39:00,687 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 906 transitions. [2023-12-15 22:39:00,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 5 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:39:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 906 transitions. [2023-12-15 22:39:00,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-15 22:39:00,692 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:39:00,692 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:39:00,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 22:39:00,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:39:00,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:39:00,692 INFO L85 PathProgramCache]: Analyzing trace with hash -781548267, now seen corresponding path program 1 times [2023-12-15 22:39:00,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:39:00,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491329662] [2023-12-15 22:39:00,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:39:00,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:39:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:00,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:39:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:39:01,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:01,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:39:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 22:39:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:39:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 22:39:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 22:39:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 22:39:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:01,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 22:39:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 22:39:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:39:01,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:39:01,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491329662] [2023-12-15 22:39:01,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491329662] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:39:01,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:39:01,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 22:39:01,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297108349] [2023-12-15 22:39:01,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:39:01,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 22:39:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:39:01,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 22:39:01,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:39:01,221 INFO L87 Difference]: Start difference. First operand 546 states and 906 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, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 22:39:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:39:07,194 INFO L93 Difference]: Finished difference Result 1420 states and 2437 transitions. [2023-12-15 22:39:07,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 22:39:07,195 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, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 102 [2023-12-15 22:39:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:39:07,199 INFO L225 Difference]: With dead ends: 1420 [2023-12-15 22:39:07,199 INFO L226 Difference]: Without dead ends: 862 [2023-12-15 22:39:07,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-12-15 22:39:07,202 INFO L413 NwaCegarLoop]: 423 mSDtfsCounter, 1624 mSDsluCounter, 2305 mSDsCounter, 0 mSdLazyCounter, 5393 mSolverCounterSat, 437 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 2728 SdHoareTripleChecker+Invalid, 5830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 437 IncrementalHoareTripleChecker+Valid, 5393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-12-15 22:39:07,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 2728 Invalid, 5830 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [437 Valid, 5393 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-12-15 22:39:07,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2023-12-15 22:39:07,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 540. [2023-12-15 22:39:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 409 states have (on average 1.6723716381418092) internal successors, (684), 425 states have internal predecessors, (684), 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) [2023-12-15 22:39:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 893 transitions. [2023-12-15 22:39:07,280 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 893 transitions. Word has length 102 [2023-12-15 22:39:07,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:39:07,281 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 893 transitions. [2023-12-15 22:39:07,281 INFO L496 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, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 22:39:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 893 transitions. [2023-12-15 22:39:07,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-15 22:39:07,282 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:39:07,283 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:39:07,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 22:39:07,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:39:07,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:39:07,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1987101271, now seen corresponding path program 1 times [2023-12-15 22:39:07,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:39:07,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007937079] [2023-12-15 22:39:07,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:39:07,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:39:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:39:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:39:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:39:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-15 22:39:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:39:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 22:39:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 22:39:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-15 22:39:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 22:39:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 22:39:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:39:07,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:39:07,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007937079] [2023-12-15 22:39:07,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007937079] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:39:07,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:39:07,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:39:07,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657792458] [2023-12-15 22:39:07,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:39:07,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:39:07,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:39:07,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:39:07,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:39:07,751 INFO L87 Difference]: Start difference. First operand 540 states and 893 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:39:12,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:39:12,346 INFO L93 Difference]: Finished difference Result 1392 states and 2388 transitions. [2023-12-15 22:39:12,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:39:12,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 103 [2023-12-15 22:39:12,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:39:12,351 INFO L225 Difference]: With dead ends: 1392 [2023-12-15 22:39:12,351 INFO L226 Difference]: Without dead ends: 862 [2023-12-15 22:39:12,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:39:12,354 INFO L413 NwaCegarLoop]: 450 mSDtfsCounter, 1043 mSDsluCounter, 1159 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 3194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-12-15 22:39:12,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1609 Invalid, 3194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-12-15 22:39:12,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2023-12-15 22:39:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 540. [2023-12-15 22:39:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 409 states have (on average 1.6699266503667483) internal successors, (683), 425 states have internal predecessors, (683), 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) [2023-12-15 22:39:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 892 transitions. [2023-12-15 22:39:12,468 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 892 transitions. Word has length 103 [2023-12-15 22:39:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:39:12,468 INFO L495 AbstractCegarLoop]: Abstraction has 540 states and 892 transitions. [2023-12-15 22:39:12,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:39:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 892 transitions. [2023-12-15 22:39:12,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 22:39:12,470 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:39:12,470 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:39:12,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 22:39:12,470 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:39:12,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:39:12,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1644873944, now seen corresponding path program 1 times [2023-12-15 22:39:12,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:39:12,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842697002] [2023-12-15 22:39:12,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:39:12,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:39:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:39:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:39:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:39:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 22:39:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 22:39:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-15 22:39:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 22:39:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:39:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 22:39:12,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-15 22:39:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:39:12,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:39:12,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842697002] [2023-12-15 22:39:12,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842697002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:39:12,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:39:12,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 22:39:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19360504] [2023-12-15 22:39:12,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:39:12,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 22:39:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:39:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 22:39:12,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:39:12,979 INFO L87 Difference]: Start difference. First operand 540 states and 892 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 22:39:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:39:18,673 INFO L93 Difference]: Finished difference Result 1408 states and 2406 transitions. [2023-12-15 22:39:18,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 22:39:18,675 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 104 [2023-12-15 22:39:18,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:39:18,678 INFO L225 Difference]: With dead ends: 1408 [2023-12-15 22:39:18,678 INFO L226 Difference]: Without dead ends: 856 [2023-12-15 22:39:18,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-12-15 22:39:18,681 INFO L413 NwaCegarLoop]: 440 mSDtfsCounter, 2080 mSDsluCounter, 2345 mSDsCounter, 0 mSdLazyCounter, 5235 mSolverCounterSat, 628 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2190 SdHoareTripleChecker+Valid, 2785 SdHoareTripleChecker+Invalid, 5863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 628 IncrementalHoareTripleChecker+Valid, 5235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:39:18,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2190 Valid, 2785 Invalid, 5863 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [628 Valid, 5235 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-12-15 22:39:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2023-12-15 22:39:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 534. [2023-12-15 22:39:18,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 403 states have (on average 1.662531017369727) internal successors, (670), 419 states have internal predecessors, (670), 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) [2023-12-15 22:39:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 879 transitions. [2023-12-15 22:39:18,765 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 879 transitions. Word has length 104 [2023-12-15 22:39:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:39:18,765 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 879 transitions. [2023-12-15 22:39:18,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 6 states have internal predecessors, (65), 3 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 22:39:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 879 transitions. [2023-12-15 22:39:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 22:39:18,767 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:39:18,767 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:39:18,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 22:39:18,767 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:39:18,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:39:18,767 INFO L85 PathProgramCache]: Analyzing trace with hash 886479048, now seen corresponding path program 1 times [2023-12-15 22:39:18,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:39:18,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83120983] [2023-12-15 22:39:18,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:39:18,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:39:18,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:39:19,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:19,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:39:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:39:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 22:39:19,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-15 22:39:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 22:39:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-15 22:39:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 22:39:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:19,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 22:39:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 22:39:19,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:39:19,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:39:19,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83120983] [2023-12-15 22:39:19,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83120983] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:39:19,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:39:19,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:39:19,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061313793] [2023-12-15 22:39:19,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:39:19,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:39:19,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:39:19,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:39:19,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:39:19,215 INFO L87 Difference]: Start difference. First operand 534 states and 879 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:39:23,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:39:23,651 INFO L93 Difference]: Finished difference Result 1380 states and 2359 transitions. [2023-12-15 22:39:23,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:39:23,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2023-12-15 22:39:23,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:39:23,655 INFO L225 Difference]: With dead ends: 1380 [2023-12-15 22:39:23,655 INFO L226 Difference]: Without dead ends: 856 [2023-12-15 22:39:23,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:39:23,658 INFO L413 NwaCegarLoop]: 430 mSDtfsCounter, 1020 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 2884 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1130 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 3126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-12-15 22:39:23,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1130 Valid, 1544 Invalid, 3126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2884 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-12-15 22:39:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2023-12-15 22:39:23,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 534. [2023-12-15 22:39:23,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 403 states have (on average 1.6600496277915633) internal successors, (669), 419 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) [2023-12-15 22:39:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 878 transitions. [2023-12-15 22:39:23,769 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 878 transitions. Word has length 105 [2023-12-15 22:39:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:39:23,769 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 878 transitions. [2023-12-15 22:39:23,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:39:23,770 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 878 transitions. [2023-12-15 22:39:23,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-15 22:39:23,772 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:39:23,772 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:39:23,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 22:39:23,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:39:23,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:39:23,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1665832524, now seen corresponding path program 1 times [2023-12-15 22:39:23,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:39:23,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772688947] [2023-12-15 22:39:23,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:39:23,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:39:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:39:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:39:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:39:24,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:39:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 22:39:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 22:39:24,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 22:39:24,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 22:39:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 22:39:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-15 22:39:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:39:24,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:39:24,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772688947] [2023-12-15 22:39:24,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772688947] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:39:24,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:39:24,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 22:39:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838594522] [2023-12-15 22:39:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:39:24,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 22:39:24,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:39:24,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 22:39:24,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:39:24,283 INFO L87 Difference]: Start difference. First operand 534 states and 878 transitions. Second operand has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 22:39:29,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:39:29,950 INFO L93 Difference]: Finished difference Result 1396 states and 2375 transitions. [2023-12-15 22:39:29,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-15 22:39:29,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 106 [2023-12-15 22:39:29,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:39:29,954 INFO L225 Difference]: With dead ends: 1396 [2023-12-15 22:39:29,954 INFO L226 Difference]: Without dead ends: 850 [2023-12-15 22:39:29,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-12-15 22:39:29,956 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 1063 mSDsluCounter, 2377 mSDsCounter, 0 mSdLazyCounter, 5261 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 5511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 5261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:39:29,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 2808 Invalid, 5511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 5261 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-12-15 22:39:29,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2023-12-15 22:39:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 528. [2023-12-15 22:39:30,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 397 states have (on average 1.6523929471032746) internal successors, (656), 413 states have internal predecessors, (656), 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) [2023-12-15 22:39:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 865 transitions. [2023-12-15 22:39:30,048 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 865 transitions. Word has length 106 [2023-12-15 22:39:30,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:39:30,048 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 865 transitions. [2023-12-15 22:39:30,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.444444444444445) internal successors, (67), 6 states have internal predecessors, (67), 3 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2023-12-15 22:39:30,049 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 865 transitions. [2023-12-15 22:39:30,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-15 22:39:30,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:39:30,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:39:30,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 22:39:30,050 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:39:30,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:39:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash 311343029, now seen corresponding path program 1 times [2023-12-15 22:39:30,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:39:30,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185109675] [2023-12-15 22:39:30,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:39:30,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:39:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:39:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:39:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:39:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:39:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 22:39:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 22:39:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 22:39:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 22:39:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:30,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 22:39:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-15 22:39:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:30,447 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:39:30,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:39:30,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185109675] [2023-12-15 22:39:30,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185109675] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:39:30,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:39:30,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:39:30,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512225567] [2023-12-15 22:39:30,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:39:30,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:39:30,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:39:30,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:39:30,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:39:30,449 INFO L87 Difference]: Start difference. First operand 528 states and 865 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, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:39:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:39:34,831 INFO L93 Difference]: Finished difference Result 1368 states and 2330 transitions. [2023-12-15 22:39:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:39:34,831 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, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2023-12-15 22:39:34,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:39:34,836 INFO L225 Difference]: With dead ends: 1368 [2023-12-15 22:39:34,836 INFO L226 Difference]: Without dead ends: 850 [2023-12-15 22:39:34,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:39:34,841 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 1979 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 2651 mSolverCounterSat, 632 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2089 SdHoareTripleChecker+Valid, 1519 SdHoareTripleChecker+Invalid, 3283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 632 IncrementalHoareTripleChecker+Valid, 2651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:39:34,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2089 Valid, 1519 Invalid, 3283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [632 Valid, 2651 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-15 22:39:34,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2023-12-15 22:39:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 528. [2023-12-15 22:39:34,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 397 states have (on average 1.649874055415617) internal successors, (655), 413 states have internal predecessors, (655), 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) [2023-12-15 22:39:34,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 864 transitions. [2023-12-15 22:39:34,957 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 864 transitions. Word has length 106 [2023-12-15 22:39:34,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:39:34,957 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 864 transitions. [2023-12-15 22:39:34,957 INFO L496 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, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:39:34,957 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 864 transitions. [2023-12-15 22:39:34,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-15 22:39:34,959 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:39:34,959 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:39:34,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 22:39:34,959 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:39:34,959 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:39:34,959 INFO L85 PathProgramCache]: Analyzing trace with hash -217595774, now seen corresponding path program 1 times [2023-12-15 22:39:34,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:39:34,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554046064] [2023-12-15 22:39:34,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:39:34,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:39:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:39:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:35,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:39:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:39:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:39:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 22:39:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 22:39:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 22:39:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:39:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:35,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:35,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 22:39:35,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-15 22:39:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:39:35,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:39:35,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554046064] [2023-12-15 22:39:35,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554046064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:39:35,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:39:35,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:39:35,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896124881] [2023-12-15 22:39:35,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:39:35,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:39:35,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:39:35,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:39:35,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:39:35,403 INFO L87 Difference]: Start difference. First operand 528 states and 864 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:39:39,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:39:39,902 INFO L93 Difference]: Finished difference Result 1377 states and 2337 transitions. [2023-12-15 22:39:39,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:39:39,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 107 [2023-12-15 22:39:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:39:39,906 INFO L225 Difference]: With dead ends: 1377 [2023-12-15 22:39:39,906 INFO L226 Difference]: Without dead ends: 859 [2023-12-15 22:39:39,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:39:39,908 INFO L413 NwaCegarLoop]: 419 mSDtfsCounter, 989 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 2831 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 3081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-12-15 22:39:39,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1510 Invalid, 3081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2831 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2023-12-15 22:39:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2023-12-15 22:39:40,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 534. [2023-12-15 22:39:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 403 states have (on average 1.6401985111662531) internal successors, (661), 419 states have internal predecessors, (661), 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) [2023-12-15 22:39:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 870 transitions. [2023-12-15 22:39:40,009 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 870 transitions. Word has length 107 [2023-12-15 22:39:40,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:39:40,009 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 870 transitions. [2023-12-15 22:39:40,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 22:39:40,009 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 870 transitions. [2023-12-15 22:39:40,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-15 22:39:40,010 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:39:40,010 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:39:40,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 22:39:40,011 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:39:40,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:39:40,011 INFO L85 PathProgramCache]: Analyzing trace with hash 621437888, now seen corresponding path program 1 times [2023-12-15 22:39:40,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:39:40,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484511965] [2023-12-15 22:39:40,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:39:40,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:39:40,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:39:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:40,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:39:40,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:39:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:39:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 22:39:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 22:39:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 22:39:40,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:39:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:39:40,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 22:39:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-15 22:39:40,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:39:40,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-15 22:39:40,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:39:40,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484511965] [2023-12-15 22:39:40,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484511965] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:39:40,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:39:40,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-15 22:39:40,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107161756] [2023-12-15 22:39:40,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:39:40,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-15 22:39:40,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:39:40,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-15 22:39:40,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:39:40,498 INFO L87 Difference]: Start difference. First operand 534 states and 870 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, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Received shutdown request... [2023-12-15 22:39:42,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 22:39:42,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2023-12-15 22:39:42,795 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 1055 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 2329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:39:42,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 658 Invalid, 2329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-15 22:39:42,796 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:39:42,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 22:39:42,797 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (534states) and FLOYD_HOARE automaton (currently 13 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (681 states constructed, input type IntersectNwa). [2023-12-15 22:39:42,799 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:39:42,801 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:39:42,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:39:42 BoogieIcfgContainer [2023-12-15 22:39:42,802 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:39:42,802 INFO L158 Benchmark]: Toolchain (without parser) took 62337.62ms. Allocated memory was 299.9MB in the beginning and 576.7MB in the end (delta: 276.8MB). Free memory was 245.4MB in the beginning and 188.8MB in the end (delta: 56.6MB). Peak memory consumption was 333.7MB. Max. memory is 8.0GB. [2023-12-15 22:39:42,802 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 215.0MB. Free memory is still 166.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:39:42,803 INFO L158 Benchmark]: CACSL2BoogieTranslator took 615.50ms. Allocated memory is still 299.9MB. Free memory was 245.4MB in the beginning and 256.0MB in the end (delta: -10.6MB). Peak memory consumption was 39.4MB. Max. memory is 8.0GB. [2023-12-15 22:39:42,803 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.98ms. Allocated memory is still 299.9MB. Free memory was 256.0MB in the beginning and 250.3MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-15 22:39:42,803 INFO L158 Benchmark]: Boogie Preprocessor took 105.75ms. Allocated memory is still 299.9MB. Free memory was 250.3MB in the beginning and 241.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2023-12-15 22:39:42,803 INFO L158 Benchmark]: RCFGBuilder took 1007.44ms. Allocated memory is still 299.9MB. Free memory was 241.9MB in the beginning and 144.4MB in the end (delta: 97.5MB). Peak memory consumption was 97.5MB. Max. memory is 8.0GB. [2023-12-15 22:39:42,803 INFO L158 Benchmark]: TraceAbstraction took 60542.68ms. Allocated memory was 299.9MB in the beginning and 576.7MB in the end (delta: 276.8MB). Free memory was 143.3MB in the beginning and 188.8MB in the end (delta: -45.5MB). Peak memory consumption was 232.4MB. Max. memory is 8.0GB. [2023-12-15 22:39:42,804 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 215.0MB. Free memory is still 166.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 615.50ms. Allocated memory is still 299.9MB. Free memory was 245.4MB in the beginning and 256.0MB in the end (delta: -10.6MB). Peak memory consumption was 39.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.98ms. Allocated memory is still 299.9MB. Free memory was 256.0MB in the beginning and 250.3MB in the end (delta: 5.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 105.75ms. Allocated memory is still 299.9MB. Free memory was 250.3MB in the beginning and 241.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * RCFGBuilder took 1007.44ms. Allocated memory is still 299.9MB. Free memory was 241.9MB in the beginning and 144.4MB in the end (delta: 97.5MB). Peak memory consumption was 97.5MB. Max. memory is 8.0GB. * TraceAbstraction took 60542.68ms. Allocated memory was 299.9MB in the beginning and 576.7MB in the end (delta: 276.8MB). Free memory was 143.3MB in the beginning and 188.8MB in the end (delta: -45.5MB). Peak memory consumption was 232.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 48]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] - GenericResultAtLocation [Line: 57]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [57] - GenericResultAtLocation [Line: 423]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [423] - GenericResultAtLocation [Line: 523]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [523] - GenericResultAtLocation [Line: 643]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification3_spec.i","") [643] - GenericResultAtLocation [Line: 832]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [832] - GenericResultAtLocation [Line: 1185]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1185] - GenericResultAtLocation [Line: 1200]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1200] - GenericResultAtLocation [Line: 2726]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [2726] - GenericResultAtLocation [Line: 3387]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3387] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 53). Cancelled while NwaCegarLoop was constructing difference of abstraction (534states) and FLOYD_HOARE automaton (currently 13 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (681 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 563 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.5s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 53.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17947 SdHoareTripleChecker+Valid, 40.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16823 mSDsluCounter, 21153 SdHoareTripleChecker+Invalid, 36.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16660 mSDsCounter, 4558 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40868 IncrementalHoareTripleChecker+Invalid, 45426 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4558 mSolverCounterUnsat, 4493 mSDtfsCounter, 40868 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 473 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=569occurred in iteration=1, InterpolantAutomatonStates: 116, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 3244 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 1142 NumberOfCodeBlocks, 1142 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1131 ConstructedInterpolants, 0 QuantifiedInterpolants, 6484 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 132/132 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown