/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:34:18,991 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:34:19,060 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 22:34:19,067 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:34:19,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:34:19,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:34:19,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:34:19,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:34:19,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:34:19,099 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:34:19,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:34:19,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:34:19,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:34:19,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:34:19,101 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:34:19,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:34:19,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:34:19,101 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:34:19,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:34:19,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:34:19,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:34:19,103 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:34:19,103 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:34:19,103 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:34:19,103 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:34:19,104 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:34:19,104 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:34:19,104 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:34:19,104 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:34:19,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:34:19,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:34:19,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:34:19,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:34:19,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:34:19,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:34:19,106 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:34:19,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:34:19,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:34:19,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:34:19,107 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:34:19,107 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:34:19,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:34:19,108 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:34:19,108 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 22:34:19,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:34:19,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:34:19,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:34:19,324 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:34:19,325 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:34:19,325 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product11.cil.c [2023-12-15 22:34:20,435 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:34:20,632 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:34:20,632 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product11.cil.c [2023-12-15 22:34:20,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4390ca3/57953895093545aab35d190995ffe762/FLAGc573f4cfd [2023-12-15 22:34:20,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb4390ca3/57953895093545aab35d190995ffe762 [2023-12-15 22:34:20,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:34:20,661 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:34:20,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:34:20,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:34:20,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:34:20,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:34:20" (1/1) ... [2023-12-15 22:34:20,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec66a67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:20, skipping insertion in model container [2023-12-15 22:34:20,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:34:20" (1/1) ... [2023-12-15 22:34:20,718 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:34:20,851 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_product11.cil.c[3700,3713] [2023-12-15 22:34:21,074 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:34:21,084 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:34:21,091 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2023-12-15 22:34:21,092 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [86] [2023-12-15 22:34:21,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [186] [2023-12-15 22:34:21,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [195] [2023-12-15 22:34:21,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [315] [2023-12-15 22:34:21,095 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [355] [2023-12-15 22:34:21,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [705] [2023-12-15 22:34:21,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1071] [2023-12-15 22:34:21,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1738] [2023-12-15 22:34:21,096 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3255] [2023-12-15 22:34:21,108 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_product11.cil.c[3700,3713] [2023-12-15 22:34:21,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:34:21,223 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:34:21,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21 WrapperNode [2023-12-15 22:34:21,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:34:21,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:34:21,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:34:21,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:34:21,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,269 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,303 INFO L138 Inliner]: procedures = 90, calls = 331, calls flagged for inlining = 26, calls inlined = 23, statements flattened = 1060 [2023-12-15 22:34:21,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:34:21,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:34:21,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:34:21,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:34:21,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,333 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,364 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2023-12-15 22:34:21,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,399 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,418 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,431 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:34:21,431 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:34:21,431 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:34:21,431 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:34:21,432 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (1/1) ... [2023-12-15 22:34:21,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:34:21,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:34:21,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-15 22:34:21,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-15 22:34:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:34:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2023-12-15 22:34:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2023-12-15 22:34:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2023-12-15 22:34:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2023-12-15 22:34:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2023-12-15 22:34:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2023-12-15 22:34:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2023-12-15 22:34:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2023-12-15 22:34:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2023-12-15 22:34:21,588 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2023-12-15 22:34:21,588 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2023-12-15 22:34:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2023-12-15 22:34:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2023-12-15 22:34:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2023-12-15 22:34:21,589 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2023-12-15 22:34:21,589 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2023-12-15 22:34:21,590 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2023-12-15 22:34:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2023-12-15 22:34:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2023-12-15 22:34:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2023-12-15 22:34:21,592 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2023-12-15 22:34:21,592 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2023-12-15 22:34:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2023-12-15 22:34:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2023-12-15 22:34:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2023-12-15 22:34:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2023-12-15 22:34:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2023-12-15 22:34:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2023-12-15 22:34:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2023-12-15 22:34:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2023-12-15 22:34:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2023-12-15 22:34:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2023-12-15 22:34:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2023-12-15 22:34:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2023-12-15 22:34:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2023-12-15 22:34:21,593 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2023-12-15 22:34:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:34:21,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2023-12-15 22:34:21,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2023-12-15 22:34:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2023-12-15 22:34:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2023-12-15 22:34:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2023-12-15 22:34:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2023-12-15 22:34:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2023-12-15 22:34:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2023-12-15 22:34:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2023-12-15 22:34:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2023-12-15 22:34:21,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:34:21,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:34:21,596 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2023-12-15 22:34:21,596 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2023-12-15 22:34:21,731 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:34:21,733 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:34:22,426 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:34:22,476 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:34:22,476 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 22:34:22,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:34:22 BoogieIcfgContainer [2023-12-15 22:34:22,477 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:34:22,478 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:34:22,478 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:34:22,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:34:22,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:34:20" (1/3) ... [2023-12-15 22:34:22,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f50620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:34:22, skipping insertion in model container [2023-12-15 22:34:22,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:34:21" (2/3) ... [2023-12-15 22:34:22,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f50620 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:34:22, skipping insertion in model container [2023-12-15 22:34:22,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:34:22" (3/3) ... [2023-12-15 22:34:22,482 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product11.cil.c [2023-12-15 22:34:22,523 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:34:22,523 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:34:22,560 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:34:22,564 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;@11392645, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:34:22,564 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:34:22,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 506 states, 391 states have (on average 1.7186700767263428) internal successors, (672), 407 states have internal predecessors, (672), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) [2023-12-15 22:34:22,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-15 22:34:22,585 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:34:22,586 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-15 22:34:22,586 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:34:22,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:34:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash -881218989, now seen corresponding path program 1 times [2023-12-15 22:34:22,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:34:22,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069669345] [2023-12-15 22:34:22,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:34:22,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:34:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:34:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 22:34:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-15 22:34:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 22:34:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 22:34:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 22:34:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:34:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 22:34:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:23,114 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-15 22:34:23,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:34:23,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069669345] [2023-12-15 22:34:23,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069669345] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:34:23,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:34:23,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:34:23,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304095529] [2023-12-15 22:34:23,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:34:23,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:34:23,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:34:23,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:34:23,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:34:23,141 INFO L87 Difference]: Start difference. First operand has 506 states, 391 states have (on average 1.7186700767263428) internal successors, (672), 407 states have internal predecessors, (672), 91 states have call successors, (91), 22 states have call predecessors, (91), 22 states have return successors, (91), 89 states have call predecessors, (91), 91 states have call successors, (91) 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-15 22:34:26,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:34:26,589 INFO L93 Difference]: Finished difference Result 1199 states and 2054 transitions. [2023-12-15 22:34:26,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:34:26,591 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-15 22:34:26,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:34:26,604 INFO L225 Difference]: With dead ends: 1199 [2023-12-15 22:34:26,604 INFO L226 Difference]: Without dead ends: 687 [2023-12-15 22:34:26,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:34:26,614 INFO L413 NwaCegarLoop]: 331 mSDtfsCounter, 1288 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 2415 mSolverCounterSat, 370 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1335 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 370 IncrementalHoareTripleChecker+Valid, 2415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-12-15 22:34:26,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1335 Valid, 1105 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [370 Valid, 2415 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-12-15 22:34:26,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-15 22:34:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 505. [2023-12-15 22:34:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 391 states have (on average 1.70076726342711) internal successors, (665), 406 states have internal predecessors, (665), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-15 22:34:26,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 846 transitions. [2023-12-15 22:34:26,762 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 846 transitions. Word has length 89 [2023-12-15 22:34:26,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:34:26,762 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 846 transitions. [2023-12-15 22:34:26,762 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-15 22:34:26,763 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 846 transitions. [2023-12-15 22:34:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-12-15 22:34:26,766 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:34:26,766 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-15 22:34:26,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 22:34:26,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:34:26,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:34:26,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1711188216, now seen corresponding path program 1 times [2023-12-15 22:34:26,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:34:26,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186685603] [2023-12-15 22:34:26,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:34:26,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:34:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:26,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:34:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:26,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:34:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 22:34:27,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 22:34:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-15 22:34:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:34:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 22:34:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 22:34:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:27,053 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-15 22:34:27,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:34:27,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186685603] [2023-12-15 22:34:27,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186685603] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:34:27,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:34:27,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:34:27,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050031519] [2023-12-15 22:34:27,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:34:27,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:34:27,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:34:27,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:34:27,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:34:27,059 INFO L87 Difference]: Start difference. First operand 505 states and 846 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-15 22:34:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:34:30,228 INFO L93 Difference]: Finished difference Result 1180 states and 1988 transitions. [2023-12-15 22:34:30,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 22:34:30,229 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-15 22:34:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:34:30,235 INFO L225 Difference]: With dead ends: 1180 [2023-12-15 22:34:30,235 INFO L226 Difference]: Without dead ends: 687 [2023-12-15 22:34:30,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:34:30,239 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 1289 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1336 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-15 22:34:30,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1336 Valid, 997 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-12-15 22:34:30,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-15 22:34:30,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 505. [2023-12-15 22:34:30,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 391 states have (on average 1.6982097186700766) internal successors, (664), 406 states have internal predecessors, (664), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-15 22:34:30,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 845 transitions. [2023-12-15 22:34:30,364 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 845 transitions. Word has length 90 [2023-12-15 22:34:30,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:34:30,364 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 845 transitions. [2023-12-15 22:34:30,364 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-15 22:34:30,364 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 845 transitions. [2023-12-15 22:34:30,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-12-15 22:34:30,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:34:30,367 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-15 22:34:30,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 22:34:30,368 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:34:30,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:34:30,369 INFO L85 PathProgramCache]: Analyzing trace with hash 979281911, now seen corresponding path program 1 times [2023-12-15 22:34:30,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:34:30,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304274264] [2023-12-15 22:34:30,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:34:30,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:34:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:34:30,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-15 22:34:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-15 22:34:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:34:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 22:34:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 22:34:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 22:34:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 22:34:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:30,640 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-15 22:34:30,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:34:30,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304274264] [2023-12-15 22:34:30,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304274264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:34:30,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:34:30,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:34:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776114464] [2023-12-15 22:34:30,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:34:30,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:34:30,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:34:30,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:34:30,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:34:30,641 INFO L87 Difference]: Start difference. First operand 505 states and 845 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-15 22:34:33,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:34:33,627 INFO L93 Difference]: Finished difference Result 1180 states and 1987 transitions. [2023-12-15 22:34:33,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 22:34:33,628 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-15 22:34:33,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:34:33,631 INFO L225 Difference]: With dead ends: 1180 [2023-12-15 22:34:33,631 INFO L226 Difference]: Without dead ends: 687 [2023-12-15 22:34:33,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:34:33,634 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 1270 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 2775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-15 22:34:33,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 1055 Invalid, 2775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-15 22:34:33,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-15 22:34:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 505. [2023-12-15 22:34:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 391 states have (on average 1.6956521739130435) internal successors, (663), 406 states have internal predecessors, (663), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-15 22:34:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 844 transitions. [2023-12-15 22:34:33,686 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 844 transitions. Word has length 91 [2023-12-15 22:34:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:34:33,686 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 844 transitions. [2023-12-15 22:34:33,686 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-15 22:34:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 844 transitions. [2023-12-15 22:34:33,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-12-15 22:34:33,687 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:34:33,688 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-15 22:34:33,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 22:34:33,688 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:34:33,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:34:33,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1134222316, now seen corresponding path program 1 times [2023-12-15 22:34:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:34:33,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503169102] [2023-12-15 22:34:33,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:34:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:34:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:34:33,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-15 22:34:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:34:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-15 22:34:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 22:34:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:33,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 22:34:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 22:34:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 22:34:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:33,919 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-15 22:34:33,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:34:33,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503169102] [2023-12-15 22:34:33,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503169102] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:34:33,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:34:33,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:34:33,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113172045] [2023-12-15 22:34:33,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:34:33,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:34:33,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:34:33,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:34:33,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:34:33,921 INFO L87 Difference]: Start difference. First operand 505 states and 844 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-15 22:34:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:34:36,870 INFO L93 Difference]: Finished difference Result 1180 states and 1986 transitions. [2023-12-15 22:34:36,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 22:34:36,870 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-15 22:34:36,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:34:36,885 INFO L225 Difference]: With dead ends: 1180 [2023-12-15 22:34:36,886 INFO L226 Difference]: Without dead ends: 687 [2023-12-15 22:34:36,902 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-15 22:34:36,902 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 1276 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:34:36,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 1018 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-15 22:34:36,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-15 22:34:36,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 505. [2023-12-15 22:34:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 391 states have (on average 1.6930946291560103) internal successors, (662), 406 states have internal predecessors, (662), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-15 22:34:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 843 transitions. [2023-12-15 22:34:36,959 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 843 transitions. Word has length 92 [2023-12-15 22:34:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:34:36,959 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 843 transitions. [2023-12-15 22:34:36,960 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-15 22:34:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 843 transitions. [2023-12-15 22:34:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-12-15 22:34:36,964 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:34:36,965 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-15 22:34:36,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 22:34:36,965 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:34:36,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:34:36,965 INFO L85 PathProgramCache]: Analyzing trace with hash -2847333, now seen corresponding path program 1 times [2023-12-15 22:34:36,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:34:36,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986127972] [2023-12-15 22:34:36,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:34:36,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:34:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:34:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-15 22:34:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-15 22:34:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 22:34:37,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 22:34:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-15 22:34:37,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 22:34:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 22:34:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:37,339 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-15 22:34:37,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:34:37,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986127972] [2023-12-15 22:34:37,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986127972] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:34:37,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:34:37,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:34:37,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990776134] [2023-12-15 22:34:37,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:34:37,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:34:37,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:34:37,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:34:37,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:34:37,342 INFO L87 Difference]: Start difference. First operand 505 states and 843 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-15 22:34:40,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:34:40,200 INFO L93 Difference]: Finished difference Result 1180 states and 1985 transitions. [2023-12-15 22:34:40,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 22:34:40,200 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-15 22:34:40,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:34:40,204 INFO L225 Difference]: With dead ends: 1180 [2023-12-15 22:34:40,204 INFO L226 Difference]: Without dead ends: 687 [2023-12-15 22:34:40,206 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-15 22:34:40,207 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 1272 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1319 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 2756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:34:40,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1319 Valid, 1022 Invalid, 2756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-15 22:34:40,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2023-12-15 22:34:40,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 505. [2023-12-15 22:34:40,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 391 states have (on average 1.6905370843989769) internal successors, (661), 406 states have internal predecessors, (661), 91 states have call successors, (91), 23 states have call predecessors, (91), 22 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-15 22:34:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 842 transitions. [2023-12-15 22:34:40,264 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 842 transitions. Word has length 93 [2023-12-15 22:34:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:34:40,264 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 842 transitions. [2023-12-15 22:34:40,264 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-15 22:34:40,264 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 842 transitions. [2023-12-15 22:34:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 22:34:40,266 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:34:40,266 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-15 22:34:40,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 22:34:40,266 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:34:40,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:34:40,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1757444304, now seen corresponding path program 1 times [2023-12-15 22:34:40,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:34:40,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569255948] [2023-12-15 22:34:40,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:34:40,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:34:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:34:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:34:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-15 22:34:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 22:34:40,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:34:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 22:34:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 22:34:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:40,618 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-15 22:34:40,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:34:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569255948] [2023-12-15 22:34:40,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569255948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:34:40,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:34:40,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 22:34:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812174741] [2023-12-15 22:34:40,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:34:40,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 22:34:40,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:34:40,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 22:34:40,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:34:40,621 INFO L87 Difference]: Start difference. First operand 505 states and 842 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 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-15 22:34:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:34:44,348 INFO L93 Difference]: Finished difference Result 1200 states and 2019 transitions. [2023-12-15 22:34:44,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 22:34:44,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 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-15 22:34:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:34:44,355 INFO L225 Difference]: With dead ends: 1200 [2023-12-15 22:34:44,355 INFO L226 Difference]: Without dead ends: 711 [2023-12-15 22:34:44,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-12-15 22:34:44,358 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 1399 mSDsluCounter, 1574 mSDsCounter, 0 mSdLazyCounter, 4561 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1446 SdHoareTripleChecker+Valid, 1875 SdHoareTripleChecker+Invalid, 4940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 4561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-15 22:34:44,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1446 Valid, 1875 Invalid, 4940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 4561 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-15 22:34:44,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-12-15 22:34:44,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 517. [2023-12-15 22:34:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 400 states have (on average 1.6875) internal successors, (675), 417 states have internal predecessors, (675), 92 states have call successors, (92), 23 states have call predecessors, (92), 24 states have return successors, (94), 89 states have call predecessors, (94), 91 states have call successors, (94) [2023-12-15 22:34:44,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 861 transitions. [2023-12-15 22:34:44,443 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 861 transitions. Word has length 94 [2023-12-15 22:34:44,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:34:44,443 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 861 transitions. [2023-12-15 22:34:44,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 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-15 22:34:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 861 transitions. [2023-12-15 22:34:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-15 22:34:44,445 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:34:44,446 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-15 22:34:44,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 22:34:44,446 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:34:44,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:34:44,446 INFO L85 PathProgramCache]: Analyzing trace with hash 272388753, now seen corresponding path program 1 times [2023-12-15 22:34:44,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:34:44,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888724248] [2023-12-15 22:34:44,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:34:44,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:34:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:34:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:34:44,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:44,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-12-15 22:34:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 22:34:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:34:44,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 22:34:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 22:34:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:44,662 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-15 22:34:44,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:34:44,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888724248] [2023-12-15 22:34:44,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888724248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:34:44,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:34:44,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:34:44,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138939700] [2023-12-15 22:34:44,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:34:44,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:34:44,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:34:44,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:34:44,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:34:44,663 INFO L87 Difference]: Start difference. First operand 517 states and 861 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-15 22:34:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:34:47,132 INFO L93 Difference]: Finished difference Result 1239 states and 2088 transitions. [2023-12-15 22:34:47,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:34:47,133 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-15 22:34:47,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:34:47,136 INFO L225 Difference]: With dead ends: 1239 [2023-12-15 22:34:47,136 INFO L226 Difference]: Without dead ends: 742 [2023-12-15 22:34:47,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:34:47,139 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 1388 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 2314 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 2314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-15 22:34:47,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 1020 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 2314 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-15 22:34:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2023-12-15 22:34:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 536. [2023-12-15 22:34:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 418 states have (on average 1.6818181818181819) internal successors, (703), 435 states have internal predecessors, (703), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2023-12-15 22:34:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 888 transitions. [2023-12-15 22:34:47,194 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 888 transitions. Word has length 94 [2023-12-15 22:34:47,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:34:47,194 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 888 transitions. [2023-12-15 22:34:47,195 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-15 22:34:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 888 transitions. [2023-12-15 22:34:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 22:34:47,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:34:47,196 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-15 22:34:47,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 22:34:47,196 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:34:47,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:34:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash -800450367, now seen corresponding path program 1 times [2023-12-15 22:34:47,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:34:47,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493227060] [2023-12-15 22:34:47,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:34:47,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:34:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:34:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:47,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 22:34:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 22:34:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 22:34:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 22:34:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 22:34:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 22:34:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:47,481 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-15 22:34:47,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:34:47,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493227060] [2023-12-15 22:34:47,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493227060] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:34:47,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:34:47,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:34:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216413827] [2023-12-15 22:34:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:34:47,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:34:47,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:34:47,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:34:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:34:47,483 INFO L87 Difference]: Start difference. First operand 536 states and 888 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-15 22:34:50,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:34:50,071 INFO L93 Difference]: Finished difference Result 1214 states and 2023 transitions. [2023-12-15 22:34:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:34:50,071 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-15 22:34:50,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:34:50,074 INFO L225 Difference]: With dead ends: 1214 [2023-12-15 22:34:50,074 INFO L226 Difference]: Without dead ends: 734 [2023-12-15 22:34:50,076 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-15 22:34:50,077 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 1358 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 2678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:34:50,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 999 Invalid, 2678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-15 22:34:50,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2023-12-15 22:34:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 536. [2023-12-15 22:34:50,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 418 states have (on average 1.6698564593301435) internal successors, (698), 435 states have internal predecessors, (698), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2023-12-15 22:34:50,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 883 transitions. [2023-12-15 22:34:50,138 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 883 transitions. Word has length 95 [2023-12-15 22:34:50,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:34:50,138 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 883 transitions. [2023-12-15 22:34:50,138 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-15 22:34:50,138 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 883 transitions. [2023-12-15 22:34:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 22:34:50,140 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:34:50,140 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-15 22:34:50,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 22:34:50,141 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:34:50,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:34:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1550383980, now seen corresponding path program 1 times [2023-12-15 22:34:50,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:34:50,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907101843] [2023-12-15 22:34:50,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:34:50,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:34:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:34:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-15 22:34:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 22:34:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-12-15 22:34:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 22:34:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 22:34:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 22:34:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:50,364 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-15 22:34:50,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:34:50,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907101843] [2023-12-15 22:34:50,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907101843] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:34:50,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:34:50,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:34:50,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530299182] [2023-12-15 22:34:50,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:34:50,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:34:50,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:34:50,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:34:50,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:34:50,366 INFO L87 Difference]: Start difference. First operand 536 states and 883 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-15 22:34:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:34:53,173 INFO L93 Difference]: Finished difference Result 1214 states and 2018 transitions. [2023-12-15 22:34:53,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:34:53,174 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-15 22:34:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:34:53,176 INFO L225 Difference]: With dead ends: 1214 [2023-12-15 22:34:53,176 INFO L226 Difference]: Without dead ends: 734 [2023-12-15 22:34:53,178 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-15 22:34:53,180 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 1345 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-12-15 22:34:53,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 1012 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-12-15 22:34:53,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2023-12-15 22:34:53,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 536. [2023-12-15 22:34:53,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 418 states have (on average 1.6578947368421053) internal successors, (693), 435 states have internal predecessors, (693), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2023-12-15 22:34:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 878 transitions. [2023-12-15 22:34:53,238 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 878 transitions. Word has length 96 [2023-12-15 22:34:53,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:34:53,238 INFO L495 AbstractCegarLoop]: Abstraction has 536 states and 878 transitions. [2023-12-15 22:34:53,238 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-15 22:34:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 878 transitions. [2023-12-15 22:34:53,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 22:34:53,240 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:34:53,240 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-15 22:34:53,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 22:34:53,240 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:34:53,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:34:53,241 INFO L85 PathProgramCache]: Analyzing trace with hash 2031516636, now seen corresponding path program 1 times [2023-12-15 22:34:53,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:34:53,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511976544] [2023-12-15 22:34:53,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:34:53,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:34:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:34:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 22:34:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 22:34:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 22:34:53,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:34:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 22:34:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 22:34:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:53,518 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-15 22:34:53,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:34:53,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511976544] [2023-12-15 22:34:53,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511976544] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:34:53,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:34:53,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 22:34:53,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762765547] [2023-12-15 22:34:53,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:34:53,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 22:34:53,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:34:53,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 22:34:53,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:34:53,519 INFO L87 Difference]: Start difference. First operand 536 states and 878 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-15 22:34:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:34:57,428 INFO L93 Difference]: Finished difference Result 1214 states and 2010 transitions. [2023-12-15 22:34:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:34:57,428 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-15 22:34:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:34:57,432 INFO L225 Difference]: With dead ends: 1214 [2023-12-15 22:34:57,432 INFO L226 Difference]: Without dead ends: 748 [2023-12-15 22:34:57,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-15 22:34:57,434 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 1329 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 4537 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1909 SdHoareTripleChecker+Invalid, 4913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 4537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-15 22:34:57,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1909 Invalid, 4913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 4537 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-15 22:34:57,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2023-12-15 22:34:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 538. [2023-12-15 22:34:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 420 states have (on average 1.6523809523809523) internal successors, (694), 437 states have internal predecessors, (694), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2023-12-15 22:34:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 879 transitions. [2023-12-15 22:34:57,493 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 879 transitions. Word has length 97 [2023-12-15 22:34:57,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:34:57,493 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 879 transitions. [2023-12-15 22:34:57,493 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-15 22:34:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 879 transitions. [2023-12-15 22:34:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-15 22:34:57,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:34:57,495 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-15 22:34:57,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 22:34:57,495 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:34:57,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:34:57,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1634053892, now seen corresponding path program 1 times [2023-12-15 22:34:57,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:34:57,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082013405] [2023-12-15 22:34:57,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:34:57,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:34:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:34:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-15 22:34:57,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 22:34:57,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 22:34:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:34:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:34:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 22:34:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:34:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 22:34:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:34:57,703 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-15 22:34:57,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:34:57,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082013405] [2023-12-15 22:34:57,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082013405] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:34:57,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:34:57,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:34:57,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944240362] [2023-12-15 22:34:57,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:34:57,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:34:57,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:34:57,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:34:57,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:34:57,704 INFO L87 Difference]: Start difference. First operand 538 states and 879 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-15 22:35:00,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:35:00,343 INFO L93 Difference]: Finished difference Result 1218 states and 2013 transitions. [2023-12-15 22:35:00,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:35:00,344 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-15 22:35:00,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:35:00,347 INFO L225 Difference]: With dead ends: 1218 [2023-12-15 22:35:00,347 INFO L226 Difference]: Without dead ends: 736 [2023-12-15 22:35:00,349 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-15 22:35:00,349 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 1331 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 2656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:35:00,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 1020 Invalid, 2656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-15 22:35:00,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2023-12-15 22:35:00,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 538. [2023-12-15 22:35:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 420 states have (on average 1.6404761904761904) internal successors, (689), 437 states have internal predecessors, (689), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2023-12-15 22:35:00,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 874 transitions. [2023-12-15 22:35:00,427 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 874 transitions. Word has length 97 [2023-12-15 22:35:00,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:35:00,428 INFO L495 AbstractCegarLoop]: Abstraction has 538 states and 874 transitions. [2023-12-15 22:35:00,428 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-15 22:35:00,428 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 874 transitions. [2023-12-15 22:35:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 22:35:00,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:35:00,431 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-15 22:35:00,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 22:35:00,431 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:35:00,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:35:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash 758062505, now seen corresponding path program 1 times [2023-12-15 22:35:00,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:35:00,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283595114] [2023-12-15 22:35:00,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:35:00,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:35:00,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:35:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 22:35:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:00,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-15 22:35:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 22:35:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 22:35:00,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 22:35:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 22:35:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:00,673 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-15 22:35:00,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:35:00,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283595114] [2023-12-15 22:35:00,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283595114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:35:00,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:35:00,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 22:35:00,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468019593] [2023-12-15 22:35:00,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:35:00,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 22:35:00,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:35:00,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 22:35:00,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:35:00,674 INFO L87 Difference]: Start difference. First operand 538 states and 874 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-15 22:35:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:35:04,915 INFO L93 Difference]: Finished difference Result 1236 states and 2033 transitions. [2023-12-15 22:35:04,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:35:04,916 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-15 22:35:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:35:04,918 INFO L225 Difference]: With dead ends: 1236 [2023-12-15 22:35:04,918 INFO L226 Difference]: Without dead ends: 766 [2023-12-15 22:35:04,920 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-15 22:35:04,920 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 1335 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 4424 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 1902 SdHoareTripleChecker+Invalid, 4808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 4424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:35:04,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 1902 Invalid, 4808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 4424 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2023-12-15 22:35:04,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2023-12-15 22:35:04,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 544. [2023-12-15 22:35:04,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 426 states have (on average 1.6291079812206573) internal successors, (694), 443 states have internal predecessors, (694), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2023-12-15 22:35:04,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 879 transitions. [2023-12-15 22:35:04,978 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 879 transitions. Word has length 98 [2023-12-15 22:35:04,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:35:04,978 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 879 transitions. [2023-12-15 22:35:04,978 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-15 22:35:04,978 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 879 transitions. [2023-12-15 22:35:04,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-15 22:35:04,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:35:04,980 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-15 22:35:04,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 22:35:04,980 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:35:04,980 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:35:04,980 INFO L85 PathProgramCache]: Analyzing trace with hash -318271417, now seen corresponding path program 1 times [2023-12-15 22:35:04,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:35:04,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181061536] [2023-12-15 22:35:04,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:35:04,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:35:04,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:35:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 22:35:05,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-15 22:35:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 22:35:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 22:35:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 22:35:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 22:35:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:05,173 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-15 22:35:05,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:35:05,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181061536] [2023-12-15 22:35:05,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181061536] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:35:05,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:35:05,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:35:05,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506388776] [2023-12-15 22:35:05,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:35:05,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:35:05,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:35:05,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:35:05,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:35:05,175 INFO L87 Difference]: Start difference. First operand 544 states and 879 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-15 22:35:07,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:35:07,566 INFO L93 Difference]: Finished difference Result 1233 states and 2019 transitions. [2023-12-15 22:35:07,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:35:07,566 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-15 22:35:07,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:35:07,569 INFO L225 Difference]: With dead ends: 1233 [2023-12-15 22:35:07,569 INFO L226 Difference]: Without dead ends: 745 [2023-12-15 22:35:07,571 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-15 22:35:07,571 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 1307 mSDsluCounter, 742 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1354 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 2645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:35:07,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1354 Valid, 1062 Invalid, 2645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-15 22:35:07,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2023-12-15 22:35:07,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 544. [2023-12-15 22:35:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 426 states have (on average 1.6173708920187793) internal successors, (689), 443 states have internal predecessors, (689), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2023-12-15 22:35:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 874 transitions. [2023-12-15 22:35:07,636 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 874 transitions. Word has length 98 [2023-12-15 22:35:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:35:07,636 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 874 transitions. [2023-12-15 22:35:07,636 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-15 22:35:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 874 transitions. [2023-12-15 22:35:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 22:35:07,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:35:07,638 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-15 22:35:07,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 22:35:07,638 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:35:07,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:35:07,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2141220073, now seen corresponding path program 1 times [2023-12-15 22:35:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:35:07,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844012884] [2023-12-15 22:35:07,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:35:07,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:35:07,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:35:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-15 22:35:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 22:35:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 22:35:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 22:35:07,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 22:35:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 22:35:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:07,870 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-15 22:35:07,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:35:07,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844012884] [2023-12-15 22:35:07,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844012884] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:35:07,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:35:07,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 22:35:07,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419530196] [2023-12-15 22:35:07,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:35:07,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 22:35:07,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:35:07,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 22:35:07,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:35:07,871 INFO L87 Difference]: Start difference. First operand 544 states and 874 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-15 22:35:10,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:35:10,856 INFO L93 Difference]: Finished difference Result 1248 states and 2034 transitions. [2023-12-15 22:35:10,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:35:10,857 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-15 22:35:10,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:35:10,859 INFO L225 Difference]: With dead ends: 1248 [2023-12-15 22:35:10,859 INFO L226 Difference]: Without dead ends: 775 [2023-12-15 22:35:10,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-15 22:35:10,861 INFO L413 NwaCegarLoop]: 323 mSDtfsCounter, 1306 mSDsluCounter, 1688 mSDsCounter, 0 mSdLazyCounter, 4445 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 2011 SdHoareTripleChecker+Invalid, 4824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 4445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-15 22:35:10,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 2011 Invalid, 4824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 4445 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-15 22:35:10,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2023-12-15 22:35:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 552. [2023-12-15 22:35:10,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 434 states have (on average 1.6036866359447004) internal successors, (696), 451 states have internal predecessors, (696), 92 states have call successors, (92), 24 states have call predecessors, (92), 25 states have return successors, (93), 89 states have call predecessors, (93), 91 states have call successors, (93) [2023-12-15 22:35:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 881 transitions. [2023-12-15 22:35:10,922 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 881 transitions. Word has length 99 [2023-12-15 22:35:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:35:10,922 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 881 transitions. [2023-12-15 22:35:10,922 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-15 22:35:10,922 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 881 transitions. [2023-12-15 22:35:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-15 22:35:10,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:35:10,924 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-15 22:35:10,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 22:35:10,924 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:35:10,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:35:10,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1229578953, now seen corresponding path program 1 times [2023-12-15 22:35:10,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:35:10,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141459528] [2023-12-15 22:35:10,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:35:10,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:35:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:35:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-15 22:35:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 22:35:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 22:35:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 22:35:11,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 22:35:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 22:35:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:11,132 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-15 22:35:11,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:35:11,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141459528] [2023-12-15 22:35:11,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141459528] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:35:11,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:35:11,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:35:11,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472144182] [2023-12-15 22:35:11,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:35:11,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:35:11,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:35:11,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:35:11,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:35:11,133 INFO L87 Difference]: Start difference. First operand 552 states and 881 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-15 22:35:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:35:14,061 INFO L93 Difference]: Finished difference Result 1289 states and 2076 transitions. [2023-12-15 22:35:14,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 22:35:14,062 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-15 22:35:14,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:35:14,065 INFO L225 Difference]: With dead ends: 1289 [2023-12-15 22:35:14,065 INFO L226 Difference]: Without dead ends: 731 [2023-12-15 22:35:14,067 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-15 22:35:14,067 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 1241 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 2298 mSolverCounterSat, 371 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 371 IncrementalHoareTripleChecker+Valid, 2298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:35:14,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 1053 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [371 Valid, 2298 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-15 22:35:14,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2023-12-15 22:35:14,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 534. [2023-12-15 22:35:14,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 419 states have (on average 1.6085918854415275) internal successors, (674), 434 states have internal predecessors, (674), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-15 22:35:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 855 transitions. [2023-12-15 22:35:14,140 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 855 transitions. Word has length 99 [2023-12-15 22:35:14,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:35:14,140 INFO L495 AbstractCegarLoop]: Abstraction has 534 states and 855 transitions. [2023-12-15 22:35:14,140 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-15 22:35:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 855 transitions. [2023-12-15 22:35:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-15 22:35:14,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:35:14,141 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-15 22:35:14,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 22:35:14,142 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:35:14,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:35:14,142 INFO L85 PathProgramCache]: Analyzing trace with hash 393390340, now seen corresponding path program 1 times [2023-12-15 22:35:14,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:35:14,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566786257] [2023-12-15 22:35:14,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:35:14,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:35:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:35:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 22:35:14,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-12-15 22:35:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 22:35:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 22:35:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 22:35:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 22:35:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:14,375 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-15 22:35:14,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:35:14,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566786257] [2023-12-15 22:35:14,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566786257] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:35:14,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:35:14,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 22:35:14,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277969607] [2023-12-15 22:35:14,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:35:14,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 22:35:14,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:35:14,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 22:35:14,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:35:14,376 INFO L87 Difference]: Start difference. First operand 534 states and 855 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-15 22:35:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:35:18,125 INFO L93 Difference]: Finished difference Result 1232 states and 1997 transitions. [2023-12-15 22:35:18,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:35:18,125 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-15 22:35:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:35:18,128 INFO L225 Difference]: With dead ends: 1232 [2023-12-15 22:35:18,128 INFO L226 Difference]: Without dead ends: 757 [2023-12-15 22:35:18,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-15 22:35:18,129 INFO L413 NwaCegarLoop]: 319 mSDtfsCounter, 1278 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 4361 mSolverCounterSat, 374 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 1992 SdHoareTripleChecker+Invalid, 4735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 374 IncrementalHoareTripleChecker+Valid, 4361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-12-15 22:35:18,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 1992 Invalid, 4735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [374 Valid, 4361 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-12-15 22:35:18,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2023-12-15 22:35:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 544. [2023-12-15 22:35:18,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 429 states have (on average 1.5944055944055944) internal successors, (684), 444 states have internal predecessors, (684), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-15 22:35:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 865 transitions. [2023-12-15 22:35:18,191 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 865 transitions. Word has length 100 [2023-12-15 22:35:18,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:35:18,191 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 865 transitions. [2023-12-15 22:35:18,191 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-15 22:35:18,191 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 865 transitions. [2023-12-15 22:35:18,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 22:35:18,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:35:18,193 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-15 22:35:18,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 22:35:18,193 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:35:18,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:35:18,193 INFO L85 PathProgramCache]: Analyzing trace with hash -836366524, now seen corresponding path program 1 times [2023-12-15 22:35:18,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:35:18,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205130458] [2023-12-15 22:35:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:35:18,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:35:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:35:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 22:35:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 22:35:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-15 22:35:18,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 22:35:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 22:35:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 22:35:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:18,413 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-15 22:35:18,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:35:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205130458] [2023-12-15 22:35:18,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205130458] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:35:18,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:35:18,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 22:35:18,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012163724] [2023-12-15 22:35:18,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:35:18,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:35:18,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:35:18,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:35:18,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:35:18,414 INFO L87 Difference]: Start difference. First operand 544 states and 865 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) [2023-12-15 22:35:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:35:20,980 INFO L93 Difference]: Finished difference Result 1234 states and 1991 transitions. [2023-12-15 22:35:20,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:35:20,981 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 101 [2023-12-15 22:35:20,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:35:20,984 INFO L225 Difference]: With dead ends: 1234 [2023-12-15 22:35:20,984 INFO L226 Difference]: Without dead ends: 734 [2023-12-15 22:35:20,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:35:20,986 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 1320 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1367 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 2600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-12-15 22:35:20,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1367 Valid, 1063 Invalid, 2600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 2225 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-12-15 22:35:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2023-12-15 22:35:21,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 544. [2023-12-15 22:35:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 429 states have (on average 1.5850815850815851) internal successors, (680), 444 states have internal predecessors, (680), 91 states have call successors, (91), 24 states have call predecessors, (91), 23 states have return successors, (90), 88 states have call predecessors, (90), 90 states have call successors, (90) [2023-12-15 22:35:21,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 861 transitions. [2023-12-15 22:35:21,061 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 861 transitions. Word has length 101 [2023-12-15 22:35:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:35:21,061 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 861 transitions. [2023-12-15 22:35:21,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2023-12-15 22:35:21,062 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 861 transitions. [2023-12-15 22:35:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-15 22:35:21,063 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:35:21,063 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-15 22:35:21,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 22:35:21,063 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:35:21,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:35:21,063 INFO L85 PathProgramCache]: Analyzing trace with hash -863432126, now seen corresponding path program 1 times [2023-12-15 22:35:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:35:21,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411422648] [2023-12-15 22:35:21,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:35:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:35:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:35:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 22:35:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 22:35:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-15 22:35:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-12-15 22:35:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 22:35:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 22:35:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-15 22:35:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 22:35:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,276 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-12-15 22:35:21,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:35:21,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411422648] [2023-12-15 22:35:21,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411422648] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:35:21,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004319316] [2023-12-15 22:35:21,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:35:21,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:35:21,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:35:21,279 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-15 22:35:21,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 22:35:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:35:21,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-15 22:35:21,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:35:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-15 22:35:21,616 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:35:21,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004319316] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:35:21,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:35:21,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2023-12-15 22:35:21,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351254221] [2023-12-15 22:35:21,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:35:21,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:35:21,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:35:21,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:35:21,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-15 22:35:21,617 INFO L87 Difference]: Start difference. First operand 544 states and 861 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:35:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:35:22,031 INFO L93 Difference]: Finished difference Result 1026 states and 1674 transitions. [2023-12-15 22:35:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 22:35:22,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2023-12-15 22:35:22,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:35:22,035 INFO L225 Difference]: With dead ends: 1026 [2023-12-15 22:35:22,035 INFO L226 Difference]: Without dead ends: 552 [2023-12-15 22:35:22,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:35:22,038 INFO L413 NwaCegarLoop]: 764 mSDtfsCounter, 762 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:35:22,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1961 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-15 22:35:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2023-12-15 22:35:22,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2023-12-15 22:35:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 436 states have (on average 1.5871559633027523) internal successors, (692), 451 states have internal predecessors, (692), 91 states have call successors, (91), 25 states have call predecessors, (91), 24 states have return successors, (91), 88 states have call predecessors, (91), 90 states have call successors, (91) [2023-12-15 22:35:22,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 874 transitions. [2023-12-15 22:35:22,129 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 874 transitions. Word has length 101 [2023-12-15 22:35:22,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:35:22,129 INFO L495 AbstractCegarLoop]: Abstraction has 552 states and 874 transitions. [2023-12-15 22:35:22,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:35:22,129 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 874 transitions. [2023-12-15 22:35:22,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 22:35:22,131 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:35:22,131 INFO L195 NwaCegarLoop]: trace histogram [3, 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-15 22:35:22,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-15 22:35:22,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-15 22:35:22,338 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:35:22,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:35:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1929544579, now seen corresponding path program 1 times [2023-12-15 22:35:22,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:35:22,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651225340] [2023-12-15 22:35:22,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:35:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:35:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2023-12-15 22:35:22,495 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-15 22:35:22,557 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:35:22,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 22:35:22,557 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 105 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-35-1 term,while SimplifyDDA2 was simplifying 35 xjuncts wrt. a ATOM-1 context. [2023-12-15 22:35:22,560 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:35:22,561 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:35:22,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:35:22 BoogieIcfgContainer [2023-12-15 22:35:22,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:35:22,563 INFO L158 Benchmark]: Toolchain (without parser) took 61902.48ms. Allocated memory was 282.1MB in the beginning and 694.2MB in the end (delta: 412.1MB). Free memory was 227.5MB in the beginning and 606.7MB in the end (delta: -379.2MB). Peak memory consumption was 33.7MB. Max. memory is 8.0GB. [2023-12-15 22:35:22,563 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 170.9MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:35:22,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.14ms. Allocated memory is still 282.1MB. Free memory was 227.5MB in the beginning and 185.2MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2023-12-15 22:35:22,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.73ms. Allocated memory is still 282.1MB. Free memory was 185.2MB in the beginning and 243.9MB in the end (delta: -58.7MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. [2023-12-15 22:35:22,564 INFO L158 Benchmark]: Boogie Preprocessor took 126.64ms. Allocated memory is still 282.1MB. Free memory was 243.9MB in the beginning and 236.1MB in the end (delta: 7.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-12-15 22:35:22,565 INFO L158 Benchmark]: RCFGBuilder took 1045.40ms. Allocated memory is still 282.1MB. Free memory was 236.1MB in the beginning and 145.4MB in the end (delta: 90.7MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. [2023-12-15 22:35:22,565 INFO L158 Benchmark]: TraceAbstraction took 60084.46ms. Allocated memory was 282.1MB in the beginning and 694.2MB in the end (delta: 412.1MB). Free memory was 144.3MB in the beginning and 606.7MB in the end (delta: -462.4MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:35:22,568 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.52ms. Allocated memory is still 170.9MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 562.14ms. Allocated memory is still 282.1MB. Free memory was 227.5MB in the beginning and 185.2MB in the end (delta: 42.3MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 79.73ms. Allocated memory is still 282.1MB. Free memory was 185.2MB in the beginning and 243.9MB in the end (delta: -58.7MB). Peak memory consumption was 6.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 126.64ms. Allocated memory is still 282.1MB. Free memory was 243.9MB in the beginning and 236.1MB in the end (delta: 7.9MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * RCFGBuilder took 1045.40ms. Allocated memory is still 282.1MB. Free memory was 236.1MB in the beginning and 145.4MB in the end (delta: 90.7MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. * TraceAbstraction took 60084.46ms. Allocated memory was 282.1MB in the beginning and 694.2MB in the end (delta: 412.1MB). Free memory was 144.3MB in the beginning and 606.7MB in the end (delta: -462.4MB). There was no memory consumed. 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,"featureselect.i","") [48] - GenericResultAtLocation [Line: 86]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [86] - GenericResultAtLocation [Line: 186]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [186] - GenericResultAtLocation [Line: 195]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [195] - GenericResultAtLocation [Line: 315]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [315] - GenericResultAtLocation [Line: 355]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [355] - GenericResultAtLocation [Line: 705]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [705] - GenericResultAtLocation [Line: 1071]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1071] - GenericResultAtLocation [Line: 1738]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1738] - GenericResultAtLocation [Line: 3255]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3255] * 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: 191]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 191). Cancelled while NwaCegarLoop was analyzing trace of length 105 with TraceHistMax 3,while InterpolatingTraceCheckCraig was constructing Craig interpolants,while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-35-1 term,while SimplifyDDA2 was simplifying 35 xjuncts wrt. a ATOM-1 context. - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 506 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.0s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 53.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 23911 SdHoareTripleChecker+Valid, 40.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23094 mSDsluCounter, 24076 SdHoareTripleChecker+Invalid, 36.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18026 mSDsCounter, 6361 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50767 IncrementalHoareTripleChecker+Invalid, 57128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6361 mSolverCounterUnsat, 6050 mSDtfsCounter, 50767 mSolverCounterSat, 0.5s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 11.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=552occurred in iteration=14, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 3360 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1825 NumberOfCodeBlocks, 1825 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1806 ConstructedInterpolants, 0 QuantifiedInterpolants, 6113 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 19 InterpolantComputations, 18 PerfectInterpolantSequences, 560/570 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