/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 05:23:01,690 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 05:23:01,759 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-16 05:23:01,764 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 05:23:01,764 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 05:23:01,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 05:23:01,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 05:23:01,786 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 05:23:01,786 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 05:23:01,789 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 05:23:01,789 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 05:23:01,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 05:23:01,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 05:23:01,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 05:23:01,791 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 05:23:01,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 05:23:01,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 05:23:01,792 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 05:23:01,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 05:23:01,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 05:23:01,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 05:23:01,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 05:23:01,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 05:23:01,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 05:23:01,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 05:23:01,793 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 05:23:01,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 05:23:01,793 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 05:23:01,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 05:23:01,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 05:23:01,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 05:23:01,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 05:23:01,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 05:23:01,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 05:23:01,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 05:23:01,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 05:23:01,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 05:23:01,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 05:23:01,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 05:23:01,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 05:23:01,796 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 05:23:01,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 05:23:01,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 05:23:01,796 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 -> false [2023-12-16 05:23:01,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 05:23:02,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 05:23:02,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 05:23:02,002 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 05:23:02,002 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 05:23:02,003 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product31.cil.c [2023-12-16 05:23:03,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 05:23:03,289 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 05:23:03,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product31.cil.c [2023-12-16 05:23:03,307 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a703c808a/23b7c400ad1d4fa7ba5775b373cbf11b/FLAGdc018ab2a [2023-12-16 05:23:03,318 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a703c808a/23b7c400ad1d4fa7ba5775b373cbf11b [2023-12-16 05:23:03,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 05:23:03,320 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 05:23:03,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 05:23:03,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 05:23:03,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 05:23:03,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:03,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587de2b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03, skipping insertion in model container [2023-12-16 05:23:03,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:03,389 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 05:23:03,839 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_spec14_product31.cil.c[71150,71163] [2023-12-16 05:23:03,843 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 05:23:03,854 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 05:23:03,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2023-12-16 05:23:03,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [716] [2023-12-16 05:23:03,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1082] [2023-12-16 05:23:03,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1183] [2023-12-16 05:23:03,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1221] [2023-12-16 05:23:03,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1341] [2023-12-16 05:23:03,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2956] [2023-12-16 05:23:03,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [3305] [2023-12-16 05:23:03,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3342] [2023-12-16 05:23:03,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3351] [2023-12-16 05:23:03,964 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_spec14_product31.cil.c[71150,71163] [2023-12-16 05:23:03,964 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 05:23:03,990 INFO L206 MainTranslator]: Completed translation [2023-12-16 05:23:03,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03 WrapperNode [2023-12-16 05:23:03,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 05:23:03,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 05:23:03,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 05:23:03,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 05:23:03,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,027 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,101 INFO L138 Inliner]: procedures = 94, calls = 342, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 897 [2023-12-16 05:23:04,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 05:23:04,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 05:23:04,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 05:23:04,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 05:23:04,112 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,112 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,128 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,146 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-16 05:23:04,147 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,147 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,217 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 05:23:04,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 05:23:04,288 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 05:23:04,288 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 05:23:04,289 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (1/1) ... [2023-12-16 05:23:04,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 05:23:04,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 05:23:04,354 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-16 05:23:04,403 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-16 05:23:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 05:23:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2023-12-16 05:23:04,420 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2023-12-16 05:23:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2023-12-16 05:23:04,420 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2023-12-16 05:23:04,420 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2023-12-16 05:23:04,420 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2023-12-16 05:23:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2023-12-16 05:23:04,421 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2023-12-16 05:23:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2023-12-16 05:23:04,421 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2023-12-16 05:23:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2023-12-16 05:23:04,421 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2023-12-16 05:23:04,421 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2023-12-16 05:23:04,422 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2023-12-16 05:23:04,422 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2023-12-16 05:23:04,422 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2023-12-16 05:23:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2023-12-16 05:23:04,424 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2023-12-16 05:23:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2023-12-16 05:23:04,424 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2023-12-16 05:23:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2023-12-16 05:23:04,424 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2023-12-16 05:23:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2023-12-16 05:23:04,424 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2023-12-16 05:23:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2023-12-16 05:23:04,424 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2023-12-16 05:23:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2023-12-16 05:23:04,424 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2023-12-16 05:23:04,425 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2023-12-16 05:23:04,425 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2023-12-16 05:23:04,425 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2023-12-16 05:23:04,425 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2023-12-16 05:23:04,425 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2023-12-16 05:23:04,425 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 05:23:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2023-12-16 05:23:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2023-12-16 05:23:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2023-12-16 05:23:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2023-12-16 05:23:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2023-12-16 05:23:04,427 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2023-12-16 05:23:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2023-12-16 05:23:04,427 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2023-12-16 05:23:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2023-12-16 05:23:04,428 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2023-12-16 05:23:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2023-12-16 05:23:04,428 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2023-12-16 05:23:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 05:23:04,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 05:23:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2023-12-16 05:23:04,428 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2023-12-16 05:23:04,580 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 05:23:04,582 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 05:23:05,249 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 05:23:05,297 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 05:23:05,297 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 05:23:05,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:23:05 BoogieIcfgContainer [2023-12-16 05:23:05,298 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 05:23:05,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 05:23:05,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 05:23:05,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 05:23:05,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 05:23:03" (1/3) ... [2023-12-16 05:23:05,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dea861c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:23:05, skipping insertion in model container [2023-12-16 05:23:05,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 05:23:03" (2/3) ... [2023-12-16 05:23:05,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dea861c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 05:23:05, skipping insertion in model container [2023-12-16 05:23:05,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 05:23:05" (3/3) ... [2023-12-16 05:23:05,303 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product31.cil.c [2023-12-16 05:23:05,315 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 05:23:05,316 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 05:23:05,356 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 05:23:05,403 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;@2c91a455, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 05:23:05,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 05:23:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 546 states, 420 states have (on average 1.7023809523809523) internal successors, (715), 436 states have internal predecessors, (715), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2023-12-16 05:23:05,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-16 05:23:05,437 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:05,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:05,438 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:05,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:05,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1945756511, now seen corresponding path program 1 times [2023-12-16 05:23:05,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:05,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382476229] [2023-12-16 05:23:05,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:05,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:05,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:05,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 05:23:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-16 05:23:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-16 05:23:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 05:23:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-16 05:23:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 05:23:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-16 05:23:06,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:06,051 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:06,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:06,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382476229] [2023-12-16 05:23:06,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382476229] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:06,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:06,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:23:06,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531931741] [2023-12-16 05:23:06,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:06,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:23:06,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:06,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:23:06,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:23:06,111 INFO L87 Difference]: Start difference. First operand has 546 states, 420 states have (on average 1.7023809523809523) internal successors, (715), 436 states have internal predecessors, (715), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:09,708 INFO L93 Difference]: Finished difference Result 1279 states and 2172 transitions. [2023-12-16 05:23:09,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 05:23:09,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2023-12-16 05:23:09,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:09,724 INFO L225 Difference]: With dead ends: 1279 [2023-12-16 05:23:09,724 INFO L226 Difference]: Without dead ends: 727 [2023-12-16 05:23:09,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-16 05:23:09,731 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 1389 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 2583 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:09,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 1053 Invalid, 2985 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [402 Valid, 2583 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-16 05:23:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2023-12-16 05:23:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 545. [2023-12-16 05:23:09,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 420 states have (on average 1.6857142857142857) internal successors, (708), 435 states have internal predecessors, (708), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-16 05:23:09,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 905 transitions. [2023-12-16 05:23:09,842 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 905 transitions. Word has length 89 [2023-12-16 05:23:09,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:09,842 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 905 transitions. [2023-12-16 05:23:09,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:09,842 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 905 transitions. [2023-12-16 05:23:09,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-16 05:23:09,846 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:09,846 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:09,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 05:23:09,847 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:09,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:09,847 INFO L85 PathProgramCache]: Analyzing trace with hash 293079729, now seen corresponding path program 1 times [2023-12-16 05:23:09,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:09,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189541242] [2023-12-16 05:23:09,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:09,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:10,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 05:23:10,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-16 05:23:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 05:23:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 05:23:10,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:10,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:10,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-16 05:23:10,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 05:23:10,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 05:23:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:10,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:10,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:10,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189541242] [2023-12-16 05:23:10,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189541242] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:10,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:10,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:23:10,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050616848] [2023-12-16 05:23:10,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:10,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:23:10,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:10,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:23:10,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:23:10,165 INFO L87 Difference]: Start difference. First operand 545 states and 905 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:13,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:13,131 INFO L93 Difference]: Finished difference Result 1260 states and 2106 transitions. [2023-12-16 05:23:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 05:23:13,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2023-12-16 05:23:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:13,138 INFO L225 Difference]: With dead ends: 1260 [2023-12-16 05:23:13,138 INFO L226 Difference]: Without dead ends: 727 [2023-12-16 05:23:13,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:23:13,141 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 1368 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1415 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 2970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:13,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1415 Valid, 1021 Invalid, 2970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-16 05:23:13,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2023-12-16 05:23:13,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 545. [2023-12-16 05:23:13,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 420 states have (on average 1.6833333333333333) internal successors, (707), 435 states have internal predecessors, (707), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-16 05:23:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 904 transitions. [2023-12-16 05:23:13,218 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 904 transitions. Word has length 90 [2023-12-16 05:23:13,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:13,218 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 904 transitions. [2023-12-16 05:23:13,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 904 transitions. [2023-12-16 05:23:13,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-16 05:23:13,221 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:13,221 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:13,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 05:23:13,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:13,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:13,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1045547869, now seen corresponding path program 1 times [2023-12-16 05:23:13,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:13,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269058827] [2023-12-16 05:23:13,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:13,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-16 05:23:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-16 05:23:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-16 05:23:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 05:23:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-16 05:23:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 05:23:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-16 05:23:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:13,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:13,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269058827] [2023-12-16 05:23:13,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269058827] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:13,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:13,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:23:13,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575091662] [2023-12-16 05:23:13,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:13,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:23:13,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:13,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:23:13,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:23:13,461 INFO L87 Difference]: Start difference. First operand 545 states and 904 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:16,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:16,059 INFO L93 Difference]: Finished difference Result 1260 states and 2105 transitions. [2023-12-16 05:23:16,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 05:23:16,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 91 [2023-12-16 05:23:16,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:16,064 INFO L225 Difference]: With dead ends: 1260 [2023-12-16 05:23:16,064 INFO L226 Difference]: Without dead ends: 727 [2023-12-16 05:23:16,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:23:16,070 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 1365 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1412 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 2966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:16,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1412 Valid, 1014 Invalid, 2966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 2566 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-16 05:23:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2023-12-16 05:23:16,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 545. [2023-12-16 05:23:16,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 420 states have (on average 1.680952380952381) internal successors, (706), 435 states have internal predecessors, (706), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-16 05:23:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 903 transitions. [2023-12-16 05:23:16,132 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 903 transitions. Word has length 91 [2023-12-16 05:23:16,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:16,133 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 903 transitions. [2023-12-16 05:23:16,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:16,133 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 903 transitions. [2023-12-16 05:23:16,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-16 05:23:16,136 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:16,136 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:16,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 05:23:16,136 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:16,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:16,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1238585355, now seen corresponding path program 1 times [2023-12-16 05:23:16,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:16,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691086746] [2023-12-16 05:23:16,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:16,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:16,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-16 05:23:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 05:23:16,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:16,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-16 05:23:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-16 05:23:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:16,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:16,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-16 05:23:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 05:23:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:16,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-16 05:23:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:16,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:16,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691086746] [2023-12-16 05:23:16,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691086746] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:16,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:16,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:23:16,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271146382] [2023-12-16 05:23:16,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:16,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:23:16,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:16,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:23:16,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:23:16,432 INFO L87 Difference]: Start difference. First operand 545 states and 903 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:19,656 INFO L93 Difference]: Finished difference Result 1260 states and 2104 transitions. [2023-12-16 05:23:19,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 05:23:19,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2023-12-16 05:23:19,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:19,661 INFO L225 Difference]: With dead ends: 1260 [2023-12-16 05:23:19,661 INFO L226 Difference]: Without dead ends: 727 [2023-12-16 05:23:19,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:23:19,665 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 1355 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 2580 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 2580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:19,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 1049 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 2580 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-16 05:23:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2023-12-16 05:23:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 545. [2023-12-16 05:23:19,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 420 states have (on average 1.6785714285714286) internal successors, (705), 435 states have internal predecessors, (705), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-16 05:23:19,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 902 transitions. [2023-12-16 05:23:19,733 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 902 transitions. Word has length 92 [2023-12-16 05:23:19,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:19,733 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 902 transitions. [2023-12-16 05:23:19,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:19,733 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 902 transitions. [2023-12-16 05:23:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-16 05:23:19,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:19,736 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:19,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 05:23:19,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:19,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:19,737 INFO L85 PathProgramCache]: Analyzing trace with hash -278067737, now seen corresponding path program 1 times [2023-12-16 05:23:19,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:19,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251963410] [2023-12-16 05:23:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:19,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:19,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:19,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:19,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:19,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:19,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-16 05:23:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:19,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-16 05:23:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:19,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:19,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 05:23:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:19,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 05:23:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:19,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:19,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:20,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-16 05:23:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:20,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 05:23:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:20,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:20,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 05:23:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:20,014 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:20,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:20,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251963410] [2023-12-16 05:23:20,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251963410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:20,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:20,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:23:20,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305431978] [2023-12-16 05:23:20,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:20,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:23:20,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:20,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:23:20,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:23:20,020 INFO L87 Difference]: Start difference. First operand 545 states and 902 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:23,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:23,034 INFO L93 Difference]: Finished difference Result 1260 states and 2103 transitions. [2023-12-16 05:23:23,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 05:23:23,035 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2023-12-16 05:23:23,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:23,039 INFO L225 Difference]: With dead ends: 1260 [2023-12-16 05:23:23,039 INFO L226 Difference]: Without dead ends: 727 [2023-12-16 05:23:23,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:23:23,041 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 1350 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 2577 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 2577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:23,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 1045 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 2577 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-16 05:23:23,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2023-12-16 05:23:23,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 545. [2023-12-16 05:23:23,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 420 states have (on average 1.6761904761904762) internal successors, (704), 435 states have internal predecessors, (704), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-16 05:23:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 901 transitions. [2023-12-16 05:23:23,098 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 901 transitions. Word has length 93 [2023-12-16 05:23:23,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:23,098 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 901 transitions. [2023-12-16 05:23:23,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:23,098 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 901 transitions. [2023-12-16 05:23:23,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-16 05:23:23,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:23,100 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:23,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 05:23:23,100 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:23,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2082919737, now seen corresponding path program 1 times [2023-12-16 05:23:23,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:23,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988574703] [2023-12-16 05:23:23,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:23,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-16 05:23:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-16 05:23:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 05:23:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 05:23:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-16 05:23:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:23,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 05:23:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:23,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:23,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988574703] [2023-12-16 05:23:23,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988574703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:23,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:23,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 05:23:23,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450301114] [2023-12-16 05:23:23,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:23,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 05:23:23,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:23,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 05:23:23,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-16 05:23:23,489 INFO L87 Difference]: Start difference. First operand 545 states and 901 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 05:23:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:27,951 INFO L93 Difference]: Finished difference Result 1280 states and 2137 transitions. [2023-12-16 05:23:27,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-16 05:23:27,952 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 94 [2023-12-16 05:23:27,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:27,955 INFO L225 Difference]: With dead ends: 1280 [2023-12-16 05:23:27,955 INFO L226 Difference]: Without dead ends: 751 [2023-12-16 05:23:27,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-12-16 05:23:27,958 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 1478 mSDsluCounter, 1914 mSDsCounter, 0 mSdLazyCounter, 5741 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 6149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 5741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:27,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1533 Valid, 2226 Invalid, 6149 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [408 Valid, 5741 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-16 05:23:27,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2023-12-16 05:23:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 557. [2023-12-16 05:23:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 429 states have (on average 1.6736596736596736) internal successors, (718), 446 states have internal predecessors, (718), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (102), 97 states have call predecessors, (102), 99 states have call successors, (102) [2023-12-16 05:23:28,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 920 transitions. [2023-12-16 05:23:28,015 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 920 transitions. Word has length 94 [2023-12-16 05:23:28,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:28,015 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 920 transitions. [2023-12-16 05:23:28,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 05:23:28,015 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 920 transitions. [2023-12-16 05:23:28,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-16 05:23:28,017 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:28,017 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:28,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 05:23:28,018 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:28,018 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:28,018 INFO L85 PathProgramCache]: Analyzing trace with hash 597864186, now seen corresponding path program 1 times [2023-12-16 05:23:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:28,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756128929] [2023-12-16 05:23:28,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:28,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:28,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-16 05:23:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-16 05:23:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 05:23:28,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 05:23:28,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-16 05:23:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-16 05:23:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:28,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:28,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756128929] [2023-12-16 05:23:28,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756128929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:28,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:28,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:23:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466369382] [2023-12-16 05:23:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:28,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:23:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:28,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:23:28,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:23:28,267 INFO L87 Difference]: Start difference. First operand 557 states and 920 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:31,593 INFO L93 Difference]: Finished difference Result 1319 states and 2206 transitions. [2023-12-16 05:23:31,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 05:23:31,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 94 [2023-12-16 05:23:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:31,597 INFO L225 Difference]: With dead ends: 1319 [2023-12-16 05:23:31,597 INFO L226 Difference]: Without dead ends: 782 [2023-12-16 05:23:31,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-16 05:23:31,602 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 1473 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1520 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 2905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:31,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1520 Valid, 1025 Invalid, 2905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 2495 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 05:23:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2023-12-16 05:23:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 576. [2023-12-16 05:23:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 447 states have (on average 1.6689038031319912) internal successors, (746), 464 states have internal predecessors, (746), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2023-12-16 05:23:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 947 transitions. [2023-12-16 05:23:31,662 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 947 transitions. Word has length 94 [2023-12-16 05:23:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:31,662 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 947 transitions. [2023-12-16 05:23:31,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 947 transitions. [2023-12-16 05:23:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 05:23:31,664 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:31,665 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:31,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 05:23:31,665 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:31,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:31,665 INFO L85 PathProgramCache]: Analyzing trace with hash -22081205, now seen corresponding path program 1 times [2023-12-16 05:23:31,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:31,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72235428] [2023-12-16 05:23:31,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:31,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:31,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 05:23:31,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:31,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-16 05:23:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-16 05:23:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:31,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-16 05:23:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-16 05:23:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-16 05:23:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:31,883 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:31,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:31,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72235428] [2023-12-16 05:23:31,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72235428] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:31,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:31,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:23:31,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103092870] [2023-12-16 05:23:31,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:31,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:23:31,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:31,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:23:31,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:23:31,884 INFO L87 Difference]: Start difference. First operand 576 states and 947 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:34,971 INFO L93 Difference]: Finished difference Result 1294 states and 2141 transitions. [2023-12-16 05:23:34,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 05:23:34,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2023-12-16 05:23:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:34,975 INFO L225 Difference]: With dead ends: 1294 [2023-12-16 05:23:34,975 INFO L226 Difference]: Without dead ends: 774 [2023-12-16 05:23:34,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 05:23:34,977 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 1433 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 2893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:34,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1042 Invalid, 2893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-16 05:23:34,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2023-12-16 05:23:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 576. [2023-12-16 05:23:35,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 447 states have (on average 1.657718120805369) internal successors, (741), 464 states have internal predecessors, (741), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2023-12-16 05:23:35,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 942 transitions. [2023-12-16 05:23:35,037 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 942 transitions. Word has length 95 [2023-12-16 05:23:35,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:35,037 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 942 transitions. [2023-12-16 05:23:35,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 942 transitions. [2023-12-16 05:23:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-16 05:23:35,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:35,040 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:35,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 05:23:35,040 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:35,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:35,040 INFO L85 PathProgramCache]: Analyzing trace with hash -811410443, now seen corresponding path program 1 times [2023-12-16 05:23:35,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:35,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819650222] [2023-12-16 05:23:35,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:35,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:35,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-16 05:23:35,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:35,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-16 05:23:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-16 05:23:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:35,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-16 05:23:35,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-16 05:23:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-16 05:23:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:35,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:35,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:35,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819650222] [2023-12-16 05:23:35,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819650222] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:35,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:35,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:23:35,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47805319] [2023-12-16 05:23:35,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:35,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:23:35,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:35,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:23:35,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:23:35,251 INFO L87 Difference]: Start difference. First operand 576 states and 942 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:38,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:38,163 INFO L93 Difference]: Finished difference Result 1294 states and 2136 transitions. [2023-12-16 05:23:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 05:23:38,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2023-12-16 05:23:38,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:38,167 INFO L225 Difference]: With dead ends: 1294 [2023-12-16 05:23:38,167 INFO L226 Difference]: Without dead ends: 774 [2023-12-16 05:23:38,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 05:23:38,169 INFO L413 NwaCegarLoop]: 315 mSDtfsCounter, 1420 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 2883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:38,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 1047 Invalid, 2883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-16 05:23:38,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states. [2023-12-16 05:23:38,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 576. [2023-12-16 05:23:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 447 states have (on average 1.6465324384787472) internal successors, (736), 464 states have internal predecessors, (736), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2023-12-16 05:23:38,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 937 transitions. [2023-12-16 05:23:38,236 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 937 transitions. Word has length 96 [2023-12-16 05:23:38,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:38,237 INFO L495 AbstractCegarLoop]: Abstraction has 576 states and 937 transitions. [2023-12-16 05:23:38,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:38,237 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 937 transitions. [2023-12-16 05:23:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 05:23:38,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:38,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:38,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 05:23:38,239 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:38,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:38,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1108898886, now seen corresponding path program 1 times [2023-12-16 05:23:38,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:38,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648679018] [2023-12-16 05:23:38,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:38,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-16 05:23:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:38,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 05:23:38,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 05:23:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:38,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 05:23:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 05:23:38,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 05:23:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:38,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:38,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:38,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648679018] [2023-12-16 05:23:38,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648679018] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:38,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:38,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 05:23:38,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807096489] [2023-12-16 05:23:38,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:38,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 05:23:38,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:38,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 05:23:38,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:23:38,534 INFO L87 Difference]: Start difference. First operand 576 states and 937 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 05:23:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:42,851 INFO L93 Difference]: Finished difference Result 1294 states and 2128 transitions. [2023-12-16 05:23:42,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 05:23:42,851 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2023-12-16 05:23:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:42,854 INFO L225 Difference]: With dead ends: 1294 [2023-12-16 05:23:42,854 INFO L226 Difference]: Without dead ends: 788 [2023-12-16 05:23:42,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-16 05:23:42,857 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 1412 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 4907 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 1923 SdHoareTripleChecker+Invalid, 5316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 4907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:42,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 1923 Invalid, 5316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 4907 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-16 05:23:42,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2023-12-16 05:23:42,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 578. [2023-12-16 05:23:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 449 states have (on average 1.641425389755011) internal successors, (737), 466 states have internal predecessors, (737), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2023-12-16 05:23:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 938 transitions. [2023-12-16 05:23:42,921 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 938 transitions. Word has length 97 [2023-12-16 05:23:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:42,921 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 938 transitions. [2023-12-16 05:23:42,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 05:23:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 938 transitions. [2023-12-16 05:23:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 05:23:42,923 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:42,923 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:42,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 05:23:42,923 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:42,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:42,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1738295654, now seen corresponding path program 1 times [2023-12-16 05:23:42,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:42,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204596202] [2023-12-16 05:23:42,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:42,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:43,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-16 05:23:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-16 05:23:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 05:23:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-16 05:23:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-16 05:23:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-16 05:23:43,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:43,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:43,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204596202] [2023-12-16 05:23:43,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204596202] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:43,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:43,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:23:43,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103889553] [2023-12-16 05:23:43,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:43,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:23:43,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:43,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:23:43,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:23:43,149 INFO L87 Difference]: Start difference. First operand 578 states and 938 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:45,788 INFO L93 Difference]: Finished difference Result 1298 states and 2131 transitions. [2023-12-16 05:23:45,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 05:23:45,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 97 [2023-12-16 05:23:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:45,791 INFO L225 Difference]: With dead ends: 1298 [2023-12-16 05:23:45,791 INFO L226 Difference]: Without dead ends: 776 [2023-12-16 05:23:45,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 05:23:45,793 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 1412 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:45,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 1031 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-16 05:23:45,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2023-12-16 05:23:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 578. [2023-12-16 05:23:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 449 states have (on average 1.6302895322939865) internal successors, (732), 466 states have internal predecessors, (732), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2023-12-16 05:23:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 933 transitions. [2023-12-16 05:23:45,865 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 933 transitions. Word has length 97 [2023-12-16 05:23:45,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:45,866 INFO L495 AbstractCegarLoop]: Abstraction has 578 states and 933 transitions. [2023-12-16 05:23:45,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 933 transitions. [2023-12-16 05:23:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 05:23:45,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:45,868 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:45,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 05:23:45,868 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:45,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:45,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1500248658, now seen corresponding path program 1 times [2023-12-16 05:23:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722683703] [2023-12-16 05:23:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:46,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 05:23:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 05:23:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 05:23:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 05:23:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 05:23:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:46,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 05:23:46,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:46,198 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:46,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:46,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722683703] [2023-12-16 05:23:46,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722683703] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:46,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:46,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 05:23:46,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474663970] [2023-12-16 05:23:46,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:46,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 05:23:46,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:46,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 05:23:46,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:23:46,200 INFO L87 Difference]: Start difference. First operand 578 states and 933 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 05:23:50,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:50,492 INFO L93 Difference]: Finished difference Result 1316 states and 2151 transitions. [2023-12-16 05:23:50,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 05:23:50,493 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 98 [2023-12-16 05:23:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:50,496 INFO L225 Difference]: With dead ends: 1316 [2023-12-16 05:23:50,496 INFO L226 Difference]: Without dead ends: 806 [2023-12-16 05:23:50,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-16 05:23:50,498 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 1427 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 4802 mSolverCounterSat, 412 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 5214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 412 IncrementalHoareTripleChecker+Valid, 4802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:50,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1856 Invalid, 5214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [412 Valid, 4802 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-16 05:23:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2023-12-16 05:23:50,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 584. [2023-12-16 05:23:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 455 states have (on average 1.6197802197802198) internal successors, (737), 472 states have internal predecessors, (737), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2023-12-16 05:23:50,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 938 transitions. [2023-12-16 05:23:50,564 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 938 transitions. Word has length 98 [2023-12-16 05:23:50,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:50,564 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 938 transitions. [2023-12-16 05:23:50,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 05:23:50,564 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 938 transitions. [2023-12-16 05:23:50,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 05:23:50,567 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:50,567 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:50,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 05:23:50,567 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:50,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:50,568 INFO L85 PathProgramCache]: Analyzing trace with hash 423914736, now seen corresponding path program 1 times [2023-12-16 05:23:50,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:50,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103332676] [2023-12-16 05:23:50,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:50,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 05:23:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-16 05:23:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-16 05:23:50,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:50,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:50,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-16 05:23:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 05:23:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-16 05:23:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:50,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:50,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103332676] [2023-12-16 05:23:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103332676] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:50,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:50,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:23:50,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107440612] [2023-12-16 05:23:50,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:50,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:23:50,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:50,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:23:50,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:23:50,788 INFO L87 Difference]: Start difference. First operand 584 states and 938 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:53,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:53,780 INFO L93 Difference]: Finished difference Result 1313 states and 2137 transitions. [2023-12-16 05:23:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 05:23:53,781 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2023-12-16 05:23:53,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:53,784 INFO L225 Difference]: With dead ends: 1313 [2023-12-16 05:23:53,784 INFO L226 Difference]: Without dead ends: 785 [2023-12-16 05:23:53,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-16 05:23:53,787 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 1396 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 2446 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:53,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1443 Valid, 1054 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2446 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-16 05:23:53,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2023-12-16 05:23:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 584. [2023-12-16 05:23:53,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 455 states have (on average 1.6087912087912088) internal successors, (732), 472 states have internal predecessors, (732), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2023-12-16 05:23:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 933 transitions. [2023-12-16 05:23:53,877 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 933 transitions. Word has length 98 [2023-12-16 05:23:53,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:53,877 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 933 transitions. [2023-12-16 05:23:53,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:23:53,877 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 933 transitions. [2023-12-16 05:23:53,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 05:23:53,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:53,879 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:53,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 05:23:53,879 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:53,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1329720479, now seen corresponding path program 1 times [2023-12-16 05:23:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:53,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208717784] [2023-12-16 05:23:53,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:54,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-16 05:23:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 05:23:54,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 05:23:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 05:23:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 05:23:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 05:23:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:54,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:54,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208717784] [2023-12-16 05:23:54,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208717784] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:54,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:54,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 05:23:54,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659537728] [2023-12-16 05:23:54,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:54,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 05:23:54,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:54,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 05:23:54,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:23:54,131 INFO L87 Difference]: Start difference. First operand 584 states and 933 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 05:23:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:23:58,502 INFO L93 Difference]: Finished difference Result 1328 states and 2152 transitions. [2023-12-16 05:23:58,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 05:23:58,502 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2023-12-16 05:23:58,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:23:58,505 INFO L225 Difference]: With dead ends: 1328 [2023-12-16 05:23:58,505 INFO L226 Difference]: Without dead ends: 815 [2023-12-16 05:23:58,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-16 05:23:58,507 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 1399 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 4783 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1945 SdHoareTripleChecker+Invalid, 5194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 4783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:23:58,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1945 Invalid, 5194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 4783 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-16 05:23:58,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2023-12-16 05:23:58,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 592. [2023-12-16 05:23:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 463 states have (on average 1.5961123110151187) internal successors, (739), 480 states have internal predecessors, (739), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2023-12-16 05:23:58,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 940 transitions. [2023-12-16 05:23:58,573 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 940 transitions. Word has length 99 [2023-12-16 05:23:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:23:58,573 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 940 transitions. [2023-12-16 05:23:58,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 05:23:58,574 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 940 transitions. [2023-12-16 05:23:58,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 05:23:58,575 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:23:58,575 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:23:58,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 05:23:58,576 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:23:58,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:23:58,576 INFO L85 PathProgramCache]: Analyzing trace with hash -418079359, now seen corresponding path program 1 times [2023-12-16 05:23:58,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:23:58,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594688311] [2023-12-16 05:23:58,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:23:58,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:23:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:23:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:58,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-16 05:23:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 05:23:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-16 05:23:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:23:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-16 05:23:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-16 05:23:58,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:23:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 05:23:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:23:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:23:58,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:23:58,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594688311] [2023-12-16 05:23:58,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594688311] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:23:58,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:23:58,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:23:58,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594406271] [2023-12-16 05:23:58,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:23:58,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:23:58,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:23:58,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:23:58,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:23:58,799 INFO L87 Difference]: Start difference. First operand 592 states and 940 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:24:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:24:01,808 INFO L93 Difference]: Finished difference Result 1369 states and 2194 transitions. [2023-12-16 05:24:01,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 05:24:01,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2023-12-16 05:24:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:24:01,812 INFO L225 Difference]: With dead ends: 1369 [2023-12-16 05:24:01,812 INFO L226 Difference]: Without dead ends: 771 [2023-12-16 05:24:01,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-16 05:24:01,815 INFO L413 NwaCegarLoop]: 309 mSDtfsCounter, 1336 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 2477 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 2477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-16 05:24:01,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 1030 Invalid, 2879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 2477 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-16 05:24:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2023-12-16 05:24:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 574. [2023-12-16 05:24:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 448 states have (on average 1.6004464285714286) internal successors, (717), 463 states have internal predecessors, (717), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-16 05:24:01,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 914 transitions. [2023-12-16 05:24:01,964 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 914 transitions. Word has length 99 [2023-12-16 05:24:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:24:01,964 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 914 transitions. [2023-12-16 05:24:01,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 05:24:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 914 transitions. [2023-12-16 05:24:01,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 05:24:01,966 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:24:01,966 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:24:01,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 05:24:01,967 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:24:01,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:24:01,967 INFO L85 PathProgramCache]: Analyzing trace with hash -941360691, now seen corresponding path program 1 times [2023-12-16 05:24:01,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:24:01,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471999980] [2023-12-16 05:24:01,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:24:01,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:24:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:24:02,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:24:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:24:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-16 05:24:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:24:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-16 05:24:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-16 05:24:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:24:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:24:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:24:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 05:24:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-16 05:24:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:24:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-16 05:24:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:02,308 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:24:02,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:24:02,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471999980] [2023-12-16 05:24:02,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471999980] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:24:02,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:24:02,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-16 05:24:02,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075172539] [2023-12-16 05:24:02,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:24:02,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 05:24:02,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:24:02,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 05:24:02,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-16 05:24:02,309 INFO L87 Difference]: Start difference. First operand 574 states and 914 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 05:24:06,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 05:24:06,753 INFO L93 Difference]: Finished difference Result 1312 states and 2115 transitions. [2023-12-16 05:24:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 05:24:06,754 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2023-12-16 05:24:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 05:24:06,757 INFO L225 Difference]: With dead ends: 1312 [2023-12-16 05:24:06,757 INFO L226 Difference]: Without dead ends: 797 [2023-12-16 05:24:06,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-16 05:24:06,763 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 1375 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 4690 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 1915 SdHoareTripleChecker+Invalid, 5100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 4690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-16 05:24:06,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1422 Valid, 1915 Invalid, 5100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 4690 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-16 05:24:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2023-12-16 05:24:06,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 584. [2023-12-16 05:24:06,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 458 states have (on average 1.5873362445414847) internal successors, (727), 473 states have internal predecessors, (727), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2023-12-16 05:24:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 924 transitions. [2023-12-16 05:24:06,877 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 924 transitions. Word has length 100 [2023-12-16 05:24:06,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 05:24:06,877 INFO L495 AbstractCegarLoop]: Abstraction has 584 states and 924 transitions. [2023-12-16 05:24:06,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 05:24:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 924 transitions. [2023-12-16 05:24:06,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-16 05:24:06,888 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 05:24:06,888 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 05:24:06,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 05:24:06,888 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 05:24:06,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 05:24:06,888 INFO L85 PathProgramCache]: Analyzing trace with hash 14589806, now seen corresponding path program 1 times [2023-12-16 05:24:06,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 05:24:06,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270158788] [2023-12-16 05:24:06,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 05:24:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 05:24:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 05:24:07,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:24:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:24:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-16 05:24:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:24:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-16 05:24:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-16 05:24:07,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:24:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:24:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-16 05:24:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-16 05:24:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-16 05:24:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 05:24:07,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-16 05:24:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 05:24:07,192 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-16 05:24:07,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 05:24:07,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270158788] [2023-12-16 05:24:07,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270158788] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 05:24:07,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 05:24:07,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 05:24:07,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449428806] [2023-12-16 05:24:07,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 05:24:07,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 05:24:07,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 05:24:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 05:24:07,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 05:24:07,194 INFO L87 Difference]: Start difference. First operand 584 states and 924 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Received shutdown request... [2023-12-16 05:24:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 05:24:08,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 05:24:08,126 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 589 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 05:24:08,133 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 05:24:08,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 146 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 05:24:08,146 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 05:24:08,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 05:24:08,147 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (584states) and FLOYD_HOARE automaton (currently 8 states, 6 states before enhancement),while ReachableStatesComputation was computing reachable states (423 states constructed, input type IntersectNwa). [2023-12-16 05:24:08,150 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 05:24:08,152 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 05:24:08,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 05:24:08 BoogieIcfgContainer [2023-12-16 05:24:08,153 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 05:24:08,154 INFO L158 Benchmark]: Toolchain (without parser) took 64833.40ms. Allocated memory was 280.0MB in the beginning and 770.7MB in the end (delta: 490.7MB). Free memory was 226.2MB in the beginning and 365.6MB in the end (delta: -139.4MB). Peak memory consumption was 352.4MB. Max. memory is 8.0GB. [2023-12-16 05:24:08,154 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 232.8MB. Free memory was 182.2MB in the beginning and 182.0MB in the end (delta: 138.6kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 05:24:08,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 669.41ms. Allocated memory is still 280.0MB. Free memory was 225.9MB in the beginning and 182.6MB in the end (delta: 43.3MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. [2023-12-16 05:24:08,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.61ms. Allocated memory is still 280.0MB. Free memory was 182.6MB in the beginning and 177.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 05:24:08,154 INFO L158 Benchmark]: Boogie Preprocessor took 185.46ms. Allocated memory is still 280.0MB. Free memory was 177.4MB in the beginning and 239.9MB in the end (delta: -62.5MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2023-12-16 05:24:08,155 INFO L158 Benchmark]: RCFGBuilder took 1009.68ms. Allocated memory is still 280.0MB. Free memory was 239.9MB in the beginning and 143.9MB in the end (delta: 95.9MB). Peak memory consumption was 95.4MB. Max. memory is 8.0GB. [2023-12-16 05:24:08,155 INFO L158 Benchmark]: TraceAbstraction took 62854.03ms. Allocated memory was 280.0MB in the beginning and 770.7MB in the end (delta: 490.7MB). Free memory was 143.4MB in the beginning and 365.6MB in the end (delta: -222.2MB). Peak memory consumption was 269.0MB. Max. memory is 8.0GB. [2023-12-16 05:24:08,156 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.10ms. Allocated memory is still 232.8MB. Free memory was 182.2MB in the beginning and 182.0MB in the end (delta: 138.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 669.41ms. Allocated memory is still 280.0MB. Free memory was 225.9MB in the beginning and 182.6MB in the end (delta: 43.3MB). Peak memory consumption was 43.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 109.61ms. Allocated memory is still 280.0MB. Free memory was 182.6MB in the beginning and 177.4MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 185.46ms. Allocated memory is still 280.0MB. Free memory was 177.4MB in the beginning and 239.9MB in the end (delta: -62.5MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * RCFGBuilder took 1009.68ms. Allocated memory is still 280.0MB. Free memory was 239.9MB in the beginning and 143.9MB in the end (delta: 95.9MB). Peak memory consumption was 95.4MB. Max. memory is 8.0GB. * TraceAbstraction took 62854.03ms. Allocated memory was 280.0MB in the beginning and 770.7MB in the end (delta: 490.7MB). Free memory was 143.4MB in the beginning and 365.6MB in the end (delta: -222.2MB). Peak memory consumption was 269.0MB. 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,"Floor.i","") [48] - GenericResultAtLocation [Line: 716]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [716] - GenericResultAtLocation [Line: 1082]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1082] - GenericResultAtLocation [Line: 1183]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1183] - GenericResultAtLocation [Line: 1221]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1221] - GenericResultAtLocation [Line: 1341]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1341] - GenericResultAtLocation [Line: 2956]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2956] - GenericResultAtLocation [Line: 3305]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [3305] - GenericResultAtLocation [Line: 3342]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3342] - GenericResultAtLocation [Line: 3351]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3351] * 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: 3347]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 3347). Cancelled while NwaCegarLoop was constructing difference of abstraction (584states) and FLOYD_HOARE automaton (currently 8 states, 6 states before enhancement),while ReachableStatesComputation was computing reachable states (423 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 26 procedures, 546 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.8s, OverallIterations: 17, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 56.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23737 SdHoareTripleChecker+Valid, 43.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22977 mSDsluCounter, 21422 SdHoareTripleChecker+Invalid, 38.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16405 mSDsCounter, 6550 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53396 IncrementalHoareTripleChecker+Invalid, 59946 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6550 mSolverCounterUnsat, 5017 mSDtfsCounter, 53396 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 685 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=592occurred in iteration=14, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 3170 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1623 NumberOfCodeBlocks, 1623 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1606 ConstructedInterpolants, 0 QuantifiedInterpolants, 5583 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 510/510 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