./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product32.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5ead0301c8481fccc00f115bae086423ed9e315d4392b2a0732a4d381346437b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:41:37,556 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:41:37,614 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:41:37,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:41:37,622 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:41:37,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:41:37,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:41:37,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:41:37,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:41:37,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:41:37,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:41:37,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:41:37,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:41:37,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:41:37,647 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:41:37,647 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:41:37,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:41:37,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:41:37,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:41:37,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:41:37,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:41:37,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:41:37,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:41:37,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:41:37,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:41:37,652 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:41:37,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:41:37,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:41:37,653 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:41:37,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:41:37,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:41:37,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:41:37,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:41:37,654 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:41:37,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:41:37,654 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:41:37,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:41:37,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:41:37,655 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:41:37,655 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:41:37,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:41:37,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:41:37,657 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5ead0301c8481fccc00f115bae086423ed9e315d4392b2a0732a4d381346437b [2024-10-14 02:41:37,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:41:37,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:41:37,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:41:37,940 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:41:37,940 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:41:37,941 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product32.cil.c [2024-10-14 02:41:39,521 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:41:39,770 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:41:39,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product32.cil.c [2024-10-14 02:41:39,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b316915/79d8cd75c451445aa938ed22b910eba6/FLAGabf4cadef [2024-10-14 02:41:39,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96b316915/79d8cd75c451445aa938ed22b910eba6 [2024-10-14 02:41:39,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:41:39,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:41:39,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:41:39,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:41:39,809 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:41:39,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:41:39" (1/1) ... [2024-10-14 02:41:39,810 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51cf18f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:39, skipping insertion in model container [2024-10-14 02:41:39,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:41:39" (1/1) ... [2024-10-14 02:41:39,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:41:40,530 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product32.cil.c[71521,71534] [2024-10-14 02:41:40,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:41:40,567 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:41:40,583 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [48] [2024-10-14 02:41:40,590 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [169] [2024-10-14 02:41:40,593 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [187] [2024-10-14 02:41:40,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [545] [2024-10-14 02:41:40,601 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [911] [2024-10-14 02:41:40,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [946] [2024-10-14 02:41:40,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [1042] [2024-10-14 02:41:40,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1709] [2024-10-14 02:41:40,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3370] [2024-10-14 02:41:40,602 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [3379] [2024-10-14 02:41:40,795 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product32.cil.c[71521,71534] [2024-10-14 02:41:40,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:41:40,827 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:41:40,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40 WrapperNode [2024-10-14 02:41:40,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:41:40,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:41:40,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:41:40,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:41:40,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:40,858 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:40,911 INFO L138 Inliner]: procedures = 96, calls = 348, calls flagged for inlining = 29, calls inlined = 25, statements flattened = 906 [2024-10-14 02:41:40,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:41:40,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:41:40,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:41:40,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:41:40,929 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:40,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:40,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:40,985 INFO L175 MemorySlicer]: Split 81 memory accesses to 20 slices as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. 9 percent of accesses are in the largest equivalence class. The 81 initializations are split as follows [2, 4, 4, 4, 2, 4, 4, 5, 3, 3, 5, 7, 4, 4, 4, 4, 4, 6, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]. [2024-10-14 02:41:40,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:40,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:41,009 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:41,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:41,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:41,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:41,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:41:41,061 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:41:41,061 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:41:41,061 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:41:41,062 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (1/1) ... [2024-10-14 02:41:41,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:41:41,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:41:41,103 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:41:41,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:41:41,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:41:41,145 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-14 02:41:41,145 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-14 02:41:41,145 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:41:41,146 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:41:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-14 02:41:41,146 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-14 02:41:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:41:41,146 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:41:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-14 02:41:41,146 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-14 02:41:41,146 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:41:41,146 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:41:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-14 02:41:41,147 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-14 02:41:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:41:41,147 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:41:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:41:41,147 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:41:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:41:41,147 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:41:41,147 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:41:41,148 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:41:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2024-10-14 02:41:41,148 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2024-10-14 02:41:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:41:41,148 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:41:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:41:41,148 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:41:41,148 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:41:41,149 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:41:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:41:41,149 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:41:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:41:41,149 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:41:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:41:41,149 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:41:41,149 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:41:41,149 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:41:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:41:41,150 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:41:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:41:41,150 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:41:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:41:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:41:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:41:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:41:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:41:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:41:41,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:41:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:41:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:41:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:41:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:41:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:41:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:41:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:41:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:41:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:41:41,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:41:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:41:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:41:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:41:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-14 02:41:41,152 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-14 02:41:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:41:41,152 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:41:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:41:41,152 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:41:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:41:41,152 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:41:41,152 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:41:41,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:41:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:41:41,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:41:41,153 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2024-10-14 02:41:41,153 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2024-10-14 02:41:41,292 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:41:41,294 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:41:42,150 INFO L? ?]: Removed 475 outVars from TransFormulas that were not future-live. [2024-10-14 02:41:42,150 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:41:42,215 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:41:42,216 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:41:42,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:41:42 BoogieIcfgContainer [2024-10-14 02:41:42,216 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:41:42,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:41:42,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:41:42,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:41:42,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:41:39" (1/3) ... [2024-10-14 02:41:42,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1847c546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:41:42, skipping insertion in model container [2024-10-14 02:41:42,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:40" (2/3) ... [2024-10-14 02:41:42,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1847c546 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:41:42, skipping insertion in model container [2024-10-14 02:41:42,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:41:42" (3/3) ... [2024-10-14 02:41:42,222 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product32.cil.c [2024-10-14 02:41:42,235 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:41:42,235 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:41:42,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:41:42,294 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c859b9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:41:42,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:41:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 559 states, 427 states have (on average 1.6955503512880563) internal successors, (724), 445 states have internal predecessors, (724), 103 states have call successors, (103), 27 states have call predecessors, (103), 27 states have return successors, (103), 100 states have call predecessors, (103), 103 states have call successors, (103) [2024-10-14 02:41:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-14 02:41:42,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:42,309 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:42,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:42,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:42,313 INFO L85 PathProgramCache]: Analyzing trace with hash 2102155152, now seen corresponding path program 1 times [2024-10-14 02:41:42,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:42,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94160763] [2024-10-14 02:41:42,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:42,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:42,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:42,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:42,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:41:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:42,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:41:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:42,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:41:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:42,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:42,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:41:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:42,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 02:41:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:41:42,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:42,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94160763] [2024-10-14 02:41:42,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94160763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:42,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:43,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:41:43,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221473286] [2024-10-14 02:41:43,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:43,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:41:43,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:43,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:41:43,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:41:43,038 INFO L87 Difference]: Start difference. First operand has 559 states, 427 states have (on average 1.6955503512880563) internal successors, (724), 445 states have internal predecessors, (724), 103 states have call successors, (103), 27 states have call predecessors, (103), 27 states have return successors, (103), 100 states have call predecessors, (103), 103 states have call successors, (103) Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:41:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:46,390 INFO L93 Difference]: Finished difference Result 1234 states and 2077 transitions. [2024-10-14 02:41:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:41:46,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 52 [2024-10-14 02:41:46,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:46,409 INFO L225 Difference]: With dead ends: 1234 [2024-10-14 02:41:46,410 INFO L226 Difference]: Without dead ends: 673 [2024-10-14 02:41:46,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:41:46,419 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 675 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:46,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 1470 Invalid, 1915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 02:41:46,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-14 02:41:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 558. [2024-10-14 02:41:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 427 states have (on average 1.6791569086651055) internal successors, (717), 444 states have internal predecessors, (717), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-14 02:41:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 922 transitions. [2024-10-14 02:41:46,571 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 922 transitions. Word has length 52 [2024-10-14 02:41:46,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:46,572 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 922 transitions. [2024-10-14 02:41:46,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:41:46,572 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 922 transitions. [2024-10-14 02:41:46,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-10-14 02:41:46,574 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:46,575 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:46,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:41:46,575 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:46,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:46,576 INFO L85 PathProgramCache]: Analyzing trace with hash -56518762, now seen corresponding path program 1 times [2024-10-14 02:41:46,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:46,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008915493] [2024-10-14 02:41:46,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:46,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:46,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:46,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:46,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:46,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:46,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:41:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:46,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:41:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:46,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:41:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:46,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:46,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:41:46,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:46,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:41:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:41:46,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008915493] [2024-10-14 02:41:46,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008915493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:46,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:46,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:41:46,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193372590] [2024-10-14 02:41:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:46,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:41:46,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:46,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:41:46,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:41:46,871 INFO L87 Difference]: Start difference. First operand 558 states and 922 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:41:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:49,488 INFO L93 Difference]: Finished difference Result 1219 states and 2028 transitions. [2024-10-14 02:41:49,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:41:49,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 53 [2024-10-14 02:41:49,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:49,494 INFO L225 Difference]: With dead ends: 1219 [2024-10-14 02:41:49,494 INFO L226 Difference]: Without dead ends: 673 [2024-10-14 02:41:49,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:41:49,497 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 668 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:49,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1447 Invalid, 1904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 02:41:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-14 02:41:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 558. [2024-10-14 02:41:49,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 427 states have (on average 1.6768149882903982) internal successors, (716), 444 states have internal predecessors, (716), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-14 02:41:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 921 transitions. [2024-10-14 02:41:49,547 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 921 transitions. Word has length 53 [2024-10-14 02:41:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:49,547 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 921 transitions. [2024-10-14 02:41:49,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:41:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 921 transitions. [2024-10-14 02:41:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 02:41:49,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:49,549 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:49,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:41:49,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:49,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1305644748, now seen corresponding path program 1 times [2024-10-14 02:41:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:49,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770767336] [2024-10-14 02:41:49,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:49,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:49,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:49,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:49,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:41:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:49,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:41:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:49,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:41:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:41:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:49,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:41:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:49,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:41:49,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:49,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770767336] [2024-10-14 02:41:49,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770767336] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:49,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:49,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:41:49,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115878299] [2024-10-14 02:41:49,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:49,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:41:49,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:49,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:41:49,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:41:49,808 INFO L87 Difference]: Start difference. First operand 558 states and 921 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:41:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:52,088 INFO L93 Difference]: Finished difference Result 1219 states and 2027 transitions. [2024-10-14 02:41:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:41:52,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 54 [2024-10-14 02:41:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:52,094 INFO L225 Difference]: With dead ends: 1219 [2024-10-14 02:41:52,096 INFO L226 Difference]: Without dead ends: 673 [2024-10-14 02:41:52,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:41:52,098 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 666 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1788 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:52,099 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 1447 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1788 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 02:41:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-14 02:41:52,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 558. [2024-10-14 02:41:52,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 427 states have (on average 1.674473067915691) internal successors, (715), 444 states have internal predecessors, (715), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-14 02:41:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 920 transitions. [2024-10-14 02:41:52,162 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 920 transitions. Word has length 54 [2024-10-14 02:41:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:52,163 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 920 transitions. [2024-10-14 02:41:52,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:41:52,163 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 920 transitions. [2024-10-14 02:41:52,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-10-14 02:41:52,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:52,165 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:52,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:41:52,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:52,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:52,166 INFO L85 PathProgramCache]: Analyzing trace with hash 144618706, now seen corresponding path program 1 times [2024-10-14 02:41:52,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:52,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089724389] [2024-10-14 02:41:52,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:52,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:52,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:52,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:52,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:52,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 02:41:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:52,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:41:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:41:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:52,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:52,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:41:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:52,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:41:52,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:41:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089724389] [2024-10-14 02:41:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089724389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:52,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:52,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:41:52,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87790019] [2024-10-14 02:41:52,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:52,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:41:52,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:52,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:41:52,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:41:52,452 INFO L87 Difference]: Start difference. First operand 558 states and 920 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:41:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:54,857 INFO L93 Difference]: Finished difference Result 1219 states and 2026 transitions. [2024-10-14 02:41:54,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:41:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2024-10-14 02:41:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:54,861 INFO L225 Difference]: With dead ends: 1219 [2024-10-14 02:41:54,861 INFO L226 Difference]: Without dead ends: 673 [2024-10-14 02:41:54,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:41:54,868 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 664 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1785 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:54,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 1447 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1785 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 02:41:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-14 02:41:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 558. [2024-10-14 02:41:54,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 427 states have (on average 1.6721311475409837) internal successors, (714), 444 states have internal predecessors, (714), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-14 02:41:54,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 919 transitions. [2024-10-14 02:41:54,972 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 919 transitions. Word has length 55 [2024-10-14 02:41:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:54,972 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 919 transitions. [2024-10-14 02:41:54,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:41:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 919 transitions. [2024-10-14 02:41:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-10-14 02:41:54,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:54,974 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:54,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:41:54,975 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:54,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:54,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1925872120, now seen corresponding path program 1 times [2024-10-14 02:41:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:54,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468988814] [2024-10-14 02:41:54,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:54,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:55,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 02:41:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:41:55,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:41:55,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 02:41:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:41:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:55,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:41:55,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:55,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468988814] [2024-10-14 02:41:55,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468988814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:55,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:55,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:41:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424276505] [2024-10-14 02:41:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:55,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:41:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:41:55,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:41:55,258 INFO L87 Difference]: Start difference. First operand 558 states and 919 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:41:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:57,750 INFO L93 Difference]: Finished difference Result 1219 states and 2025 transitions. [2024-10-14 02:41:57,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:41:57,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 56 [2024-10-14 02:41:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:57,754 INFO L225 Difference]: With dead ends: 1219 [2024-10-14 02:41:57,754 INFO L226 Difference]: Without dead ends: 673 [2024-10-14 02:41:57,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:41:57,760 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 662 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:57,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1447 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 02:41:57,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2024-10-14 02:41:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 558. [2024-10-14 02:41:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 427 states have (on average 1.6697892271662764) internal successors, (713), 444 states have internal predecessors, (713), 103 states have call successors, (103), 28 states have call predecessors, (103), 27 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-14 02:41:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 918 transitions. [2024-10-14 02:41:57,807 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 918 transitions. Word has length 56 [2024-10-14 02:41:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:57,807 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 918 transitions. [2024-10-14 02:41:57,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:41:57,808 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 918 transitions. [2024-10-14 02:41:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-14 02:41:57,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:57,808 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:57,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:41:57,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:57,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:57,811 INFO L85 PathProgramCache]: Analyzing trace with hash -2125000178, now seen corresponding path program 1 times [2024-10-14 02:41:57,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:57,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016377786] [2024-10-14 02:41:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:58,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:41:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:41:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 02:41:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:41:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:41:58,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:58,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016377786] [2024-10-14 02:41:58,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016377786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:58,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:58,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:41:58,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506402324] [2024-10-14 02:41:58,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:58,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:41:58,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:58,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:41:58,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:41:58,147 INFO L87 Difference]: Start difference. First operand 558 states and 918 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:00,794 INFO L93 Difference]: Finished difference Result 1254 states and 2084 transitions. [2024-10-14 02:42:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:42:00,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 57 [2024-10-14 02:42:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:00,798 INFO L225 Difference]: With dead ends: 1254 [2024-10-14 02:42:00,798 INFO L226 Difference]: Without dead ends: 712 [2024-10-14 02:42:00,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:42:00,800 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 733 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 2105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:00,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 1396 Invalid, 2105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1989 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 02:42:00,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-10-14 02:42:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 577. [2024-10-14 02:42:00,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 445 states have (on average 1.6651685393258426) internal successors, (741), 462 states have internal predecessors, (741), 103 states have call successors, (103), 29 states have call predecessors, (103), 28 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-14 02:42:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 946 transitions. [2024-10-14 02:42:00,848 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 946 transitions. Word has length 57 [2024-10-14 02:42:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:00,848 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 946 transitions. [2024-10-14 02:42:00,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 946 transitions. [2024-10-14 02:42:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 02:42:00,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:00,849 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:00,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:42:00,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:00,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash 165168665, now seen corresponding path program 1 times [2024-10-14 02:42:00,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:00,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505725895] [2024-10-14 02:42:00,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:00,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:01,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:01,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:01,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:01,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:42:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:42:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:01,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:42:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:01,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:42:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:42:01,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:01,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505725895] [2024-10-14 02:42:01,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505725895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:01,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:01,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 02:42:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166305956] [2024-10-14 02:42:01,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:01,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:42:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:01,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:42:01,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:42:01,190 INFO L87 Difference]: Start difference. First operand 577 states and 946 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:42:05,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:05,468 INFO L93 Difference]: Finished difference Result 1273 states and 2096 transitions. [2024-10-14 02:42:05,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 02:42:05,468 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 58 [2024-10-14 02:42:05,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:05,472 INFO L225 Difference]: With dead ends: 1273 [2024-10-14 02:42:05,472 INFO L226 Difference]: Without dead ends: 756 [2024-10-14 02:42:05,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2024-10-14 02:42:05,475 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 818 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 4858 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 3747 SdHoareTripleChecker+Invalid, 4968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 4858 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:05,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 3747 Invalid, 4968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 4858 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 02:42:05,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2024-10-14 02:42:05,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 589. [2024-10-14 02:42:05,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 454 states have (on average 1.6629955947136563) internal successors, (755), 473 states have internal predecessors, (755), 104 states have call successors, (104), 29 states have call predecessors, (104), 30 states have return successors, (105), 100 states have call predecessors, (105), 103 states have call successors, (105) [2024-10-14 02:42:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 964 transitions. [2024-10-14 02:42:05,528 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 964 transitions. Word has length 58 [2024-10-14 02:42:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:05,529 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 964 transitions. [2024-10-14 02:42:05,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:42:05,529 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 964 transitions. [2024-10-14 02:42:05,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 02:42:05,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:05,530 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:05,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:42:05,530 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:05,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:05,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2136108122, now seen corresponding path program 1 times [2024-10-14 02:42:05,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:05,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609967860] [2024-10-14 02:42:05,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:05,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:05,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:05,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:05,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:05,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:05,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:05,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:42:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:05,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:42:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:05,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:42:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:42:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:05,756 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:42:05,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:05,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609967860] [2024-10-14 02:42:05,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609967860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:05,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:05,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:42:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937351143] [2024-10-14 02:42:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:05,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:05,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:05,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:42:05,758 INFO L87 Difference]: Start difference. First operand 589 states and 964 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:08,064 INFO L93 Difference]: Finished difference Result 1265 states and 2080 transitions. [2024-10-14 02:42:08,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:08,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2024-10-14 02:42:08,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:08,070 INFO L225 Difference]: With dead ends: 1265 [2024-10-14 02:42:08,071 INFO L226 Difference]: Without dead ends: 732 [2024-10-14 02:42:08,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:08,073 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 721 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:08,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1403 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 02:42:08,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-14 02:42:08,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 589. [2024-10-14 02:42:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 454 states have (on average 1.6519823788546255) internal successors, (750), 473 states have internal predecessors, (750), 104 states have call successors, (104), 29 states have call predecessors, (104), 30 states have return successors, (105), 100 states have call predecessors, (105), 103 states have call successors, (105) [2024-10-14 02:42:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 959 transitions. [2024-10-14 02:42:08,119 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 959 transitions. Word has length 58 [2024-10-14 02:42:08,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:08,119 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 959 transitions. [2024-10-14 02:42:08,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 959 transitions. [2024-10-14 02:42:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-14 02:42:08,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:08,121 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:08,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:42:08,121 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:08,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1202910830, now seen corresponding path program 1 times [2024-10-14 02:42:08,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:08,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894435524] [2024-10-14 02:42:08,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:08,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:08,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:08,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:08,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:08,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:42:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:08,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:42:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:08,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:08,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:08,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:42:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:08,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:42:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:42:08,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:08,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894435524] [2024-10-14 02:42:08,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894435524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:08,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:08,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:42:08,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808641621] [2024-10-14 02:42:08,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:08,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:08,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:08,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:08,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:42:08,364 INFO L87 Difference]: Start difference. First operand 589 states and 959 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:10,766 INFO L93 Difference]: Finished difference Result 1265 states and 2075 transitions. [2024-10-14 02:42:10,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:10,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 59 [2024-10-14 02:42:10,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:10,771 INFO L225 Difference]: With dead ends: 1265 [2024-10-14 02:42:10,771 INFO L226 Difference]: Without dead ends: 732 [2024-10-14 02:42:10,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:10,773 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 720 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 2064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:10,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 1403 Invalid, 2064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 02:42:10,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-14 02:42:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 589. [2024-10-14 02:42:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 454 states have (on average 1.6409691629955947) internal successors, (745), 473 states have internal predecessors, (745), 104 states have call successors, (104), 29 states have call predecessors, (104), 30 states have return successors, (105), 100 states have call predecessors, (105), 103 states have call successors, (105) [2024-10-14 02:42:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 954 transitions. [2024-10-14 02:42:10,815 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 954 transitions. Word has length 59 [2024-10-14 02:42:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:10,815 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 954 transitions. [2024-10-14 02:42:10,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 954 transitions. [2024-10-14 02:42:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 02:42:10,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:10,816 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:10,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:42:10,816 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:10,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1951733857, now seen corresponding path program 1 times [2024-10-14 02:42:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343792055] [2024-10-14 02:42:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:10,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:11,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:42:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:42:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:42:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:42:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:42:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:11,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343792055] [2024-10-14 02:42:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343792055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:11,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:11,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:42:11,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377821246] [2024-10-14 02:42:11,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:11,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:11,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:11,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:11,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:42:11,239 INFO L87 Difference]: Start difference. First operand 589 states and 954 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:13,483 INFO L93 Difference]: Finished difference Result 1265 states and 2070 transitions. [2024-10-14 02:42:13,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:13,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 60 [2024-10-14 02:42:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:13,489 INFO L225 Difference]: With dead ends: 1265 [2024-10-14 02:42:13,492 INFO L226 Difference]: Without dead ends: 732 [2024-10-14 02:42:13,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:13,494 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 719 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:13,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 1400 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 02:42:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 732 states. [2024-10-14 02:42:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 732 to 589. [2024-10-14 02:42:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 454 states have (on average 1.6299559471365639) internal successors, (740), 473 states have internal predecessors, (740), 104 states have call successors, (104), 29 states have call predecessors, (104), 30 states have return successors, (105), 100 states have call predecessors, (105), 103 states have call successors, (105) [2024-10-14 02:42:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 949 transitions. [2024-10-14 02:42:13,614 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 949 transitions. Word has length 60 [2024-10-14 02:42:13,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:13,618 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 949 transitions. [2024-10-14 02:42:13,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:13,619 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 949 transitions. [2024-10-14 02:42:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 02:42:13,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:13,620 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:13,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:42:13,620 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:13,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:13,621 INFO L85 PathProgramCache]: Analyzing trace with hash -634549568, now seen corresponding path program 1 times [2024-10-14 02:42:13,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:13,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667422960] [2024-10-14 02:42:13,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:13,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:13,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:13,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:13,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:42:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:13,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:42:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:13,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:13,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:42:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:13,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:42:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:42:13,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667422960] [2024-10-14 02:42:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667422960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:13,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:13,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 02:42:13,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439393325] [2024-10-14 02:42:13,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:13,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 02:42:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:13,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 02:42:13,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:42:13,904 INFO L87 Difference]: Start difference. First operand 589 states and 949 transitions. Second operand has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:42:17,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:17,135 INFO L93 Difference]: Finished difference Result 1251 states and 2041 transitions. [2024-10-14 02:42:17,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:42:17,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 60 [2024-10-14 02:42:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:17,140 INFO L225 Difference]: With dead ends: 1251 [2024-10-14 02:42:17,141 INFO L226 Difference]: Without dead ends: 730 [2024-10-14 02:42:17,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:42:17,143 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 707 mSDsluCounter, 2256 mSDsCounter, 0 mSdLazyCounter, 3649 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 790 SdHoareTripleChecker+Valid, 2725 SdHoareTripleChecker+Invalid, 3758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 3649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:17,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [790 Valid, 2725 Invalid, 3758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 3649 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 02:42:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-14 02:42:17,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 593. [2024-10-14 02:42:17,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 458 states have (on average 1.6222707423580787) internal successors, (743), 477 states have internal predecessors, (743), 104 states have call successors, (104), 29 states have call predecessors, (104), 30 states have return successors, (105), 100 states have call predecessors, (105), 103 states have call successors, (105) [2024-10-14 02:42:17,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 952 transitions. [2024-10-14 02:42:17,205 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 952 transitions. Word has length 60 [2024-10-14 02:42:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:17,205 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 952 transitions. [2024-10-14 02:42:17,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.0) internal successors, (42), 6 states have internal predecessors, (42), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:42:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 952 transitions. [2024-10-14 02:42:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 02:42:17,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:17,206 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:17,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:42:17,206 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:17,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:17,207 INFO L85 PathProgramCache]: Analyzing trace with hash 286105463, now seen corresponding path program 1 times [2024-10-14 02:42:17,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:17,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846654260] [2024-10-14 02:42:17,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:17,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:17,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:17,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:17,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:42:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 02:42:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:42:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:42:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:17,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:42:17,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:17,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846654260] [2024-10-14 02:42:17,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846654260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:17,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:17,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:42:17,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174381251] [2024-10-14 02:42:17,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:17,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:17,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:17,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:17,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:42:17,463 INFO L87 Difference]: Start difference. First operand 593 states and 952 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:19,601 INFO L93 Difference]: Finished difference Result 1275 states and 2070 transitions. [2024-10-14 02:42:19,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 61 [2024-10-14 02:42:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:19,606 INFO L225 Difference]: With dead ends: 1275 [2024-10-14 02:42:19,606 INFO L226 Difference]: Without dead ends: 738 [2024-10-14 02:42:19,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:19,608 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 717 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:19,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 1400 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1913 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 02:42:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-10-14 02:42:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 593. [2024-10-14 02:42:19,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 458 states have (on average 1.611353711790393) internal successors, (738), 477 states have internal predecessors, (738), 104 states have call successors, (104), 29 states have call predecessors, (104), 30 states have return successors, (105), 100 states have call predecessors, (105), 103 states have call successors, (105) [2024-10-14 02:42:19,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 947 transitions. [2024-10-14 02:42:19,660 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 947 transitions. Word has length 61 [2024-10-14 02:42:19,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:19,660 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 947 transitions. [2024-10-14 02:42:19,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 947 transitions. [2024-10-14 02:42:19,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-14 02:42:19,661 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:19,661 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:19,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:42:19,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:19,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:19,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1440851212, now seen corresponding path program 1 times [2024-10-14 02:42:19,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:19,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657767766] [2024-10-14 02:42:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:19,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:19,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:19,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:19,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:19,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:42:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:19,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 02:42:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:19,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:19,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:42:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:42:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:42:19,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:19,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657767766] [2024-10-14 02:42:19,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657767766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:19,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:19,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 02:42:19,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670971051] [2024-10-14 02:42:19,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:19,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 02:42:19,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:19,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 02:42:19,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:42:19,913 INFO L87 Difference]: Start difference. First operand 593 states and 947 transitions. Second operand has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:42:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:22,946 INFO L93 Difference]: Finished difference Result 1254 states and 2033 transitions. [2024-10-14 02:42:22,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:42:22,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 61 [2024-10-14 02:42:22,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:22,951 INFO L225 Difference]: With dead ends: 1254 [2024-10-14 02:42:22,951 INFO L226 Difference]: Without dead ends: 733 [2024-10-14 02:42:22,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:42:22,953 INFO L432 NwaCegarLoop]: 464 mSDtfsCounter, 703 mSDsluCounter, 2234 mSDsCounter, 0 mSdLazyCounter, 3636 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 3746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 3636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:22,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 2698 Invalid, 3746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 3636 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 02:42:22,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2024-10-14 02:42:23,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 596. [2024-10-14 02:42:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 461 states have (on average 1.6052060737527114) internal successors, (740), 480 states have internal predecessors, (740), 104 states have call successors, (104), 29 states have call predecessors, (104), 30 states have return successors, (105), 100 states have call predecessors, (105), 103 states have call successors, (105) [2024-10-14 02:42:23,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 949 transitions. [2024-10-14 02:42:23,042 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 949 transitions. Word has length 61 [2024-10-14 02:42:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:23,042 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 949 transitions. [2024-10-14 02:42:23,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.142857142857143) internal successors, (43), 6 states have internal predecessors, (43), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:42:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 949 transitions. [2024-10-14 02:42:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-14 02:42:23,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:23,043 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:23,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 02:42:23,043 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:23,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:23,044 INFO L85 PathProgramCache]: Analyzing trace with hash 621197028, now seen corresponding path program 1 times [2024-10-14 02:42:23,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:23,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326584471] [2024-10-14 02:42:23,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:23,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:23,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:23,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:23,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:42:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:23,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 02:42:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:23,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:23,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:42:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 02:42:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:23,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:42:23,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:23,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326584471] [2024-10-14 02:42:23,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326584471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:23,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:23,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:42:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365026890] [2024-10-14 02:42:23,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:23,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:23,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:23,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:23,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:42:23,239 INFO L87 Difference]: Start difference. First operand 596 states and 949 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:25,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:25,810 INFO L93 Difference]: Finished difference Result 1305 states and 2097 transitions. [2024-10-14 02:42:25,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:25,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 62 [2024-10-14 02:42:25,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:25,816 INFO L225 Difference]: With dead ends: 1305 [2024-10-14 02:42:25,816 INFO L226 Difference]: Without dead ends: 678 [2024-10-14 02:42:25,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:42:25,819 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 662 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1779 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1500 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:25,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1500 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1779 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 02:42:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-10-14 02:42:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 555. [2024-10-14 02:42:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 423 states have (on average 1.6170212765957446) internal successors, (684), 440 states have internal predecessors, (684), 103 states have call successors, (103), 29 states have call predecessors, (103), 28 states have return successors, (102), 99 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-14 02:42:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 889 transitions. [2024-10-14 02:42:25,874 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 889 transitions. Word has length 62 [2024-10-14 02:42:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:25,875 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 889 transitions. [2024-10-14 02:42:25,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 02:42:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 889 transitions. [2024-10-14 02:42:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 02:42:25,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:25,876 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:25,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 02:42:25,876 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:25,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:25,876 INFO L85 PathProgramCache]: Analyzing trace with hash 89867097, now seen corresponding path program 1 times [2024-10-14 02:42:25,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:25,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42204831] [2024-10-14 02:42:25,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:25,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:25,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:42:26,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:26,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:42:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 02:42:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 02:42:26,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:26,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42204831] [2024-10-14 02:42:26,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42204831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:26,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:26,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 02:42:26,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879312174] [2024-10-14 02:42:26,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:26,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 02:42:26,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:26,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 02:42:26,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 02:42:26,112 INFO L87 Difference]: Start difference. First operand 555 states and 889 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:42:29,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:29,781 INFO L93 Difference]: Finished difference Result 1795 states and 2947 transitions. [2024-10-14 02:42:29,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:42:29,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 64 [2024-10-14 02:42:29,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:29,792 INFO L225 Difference]: With dead ends: 1795 [2024-10-14 02:42:29,792 INFO L226 Difference]: Without dead ends: 1277 [2024-10-14 02:42:29,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:42:29,794 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 1901 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:29,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2005 Valid, 995 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 1271 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 02:42:29,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2024-10-14 02:42:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 999. [2024-10-14 02:42:29,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 767 states have (on average 1.6310299869621903) internal successors, (1251), 793 states have internal predecessors, (1251), 182 states have call successors, (182), 51 states have call predecessors, (182), 49 states have return successors, (187), 169 states have call predecessors, (187), 180 states have call successors, (187) [2024-10-14 02:42:29,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1620 transitions. [2024-10-14 02:42:29,956 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1620 transitions. Word has length 64 [2024-10-14 02:42:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:29,956 INFO L471 AbstractCegarLoop]: Abstraction has 999 states and 1620 transitions. [2024-10-14 02:42:29,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-10-14 02:42:29,957 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1620 transitions. [2024-10-14 02:42:29,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-14 02:42:29,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:29,962 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:29,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 02:42:29,962 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:29,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:29,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1611897861, now seen corresponding path program 1 times [2024-10-14 02:42:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:29,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425682499] [2024-10-14 02:42:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:29,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 02:42:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:42:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:42:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:42:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 02:42:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 02:42:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,572 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 02:42:30,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:30,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425682499] [2024-10-14 02:42:30,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425682499] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:30,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932518986] [2024-10-14 02:42:30,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:30,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:30,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:30,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:30,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 02:42:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 02:42:30,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:31,037 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:31,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932518986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:31,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:31,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2024-10-14 02:42:31,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113388234] [2024-10-14 02:42:31,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:31,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:31,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:31,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:31,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:42:31,043 INFO L87 Difference]: Start difference. First operand 999 states and 1620 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 02:42:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:31,771 INFO L93 Difference]: Finished difference Result 2532 states and 4111 transitions. [2024-10-14 02:42:31,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:31,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 114 [2024-10-14 02:42:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:31,780 INFO L225 Difference]: With dead ends: 2532 [2024-10-14 02:42:31,780 INFO L226 Difference]: Without dead ends: 1570 [2024-10-14 02:42:31,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-14 02:42:31,785 INFO L432 NwaCegarLoop]: 1110 mSDtfsCounter, 828 mSDsluCounter, 3282 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 4392 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:31,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 4392 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 02:42:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-10-14 02:42:32,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1568. [2024-10-14 02:42:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1199 states have (on average 1.6013344453711427) internal successors, (1920), 1228 states have internal predecessors, (1920), 285 states have call successors, (285), 87 states have call predecessors, (285), 83 states have return successors, (315), 268 states have call predecessors, (315), 281 states have call successors, (315) [2024-10-14 02:42:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2520 transitions. [2024-10-14 02:42:32,059 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2520 transitions. Word has length 114 [2024-10-14 02:42:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:32,060 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2520 transitions. [2024-10-14 02:42:32,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 02:42:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2520 transitions. [2024-10-14 02:42:32,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 02:42:32,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:32,065 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:32,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 02:42:32,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 02:42:32,270 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:32,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:32,271 INFO L85 PathProgramCache]: Analyzing trace with hash -76446690, now seen corresponding path program 1 times [2024-10-14 02:42:32,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:32,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277876658] [2024-10-14 02:42:32,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:32,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:32,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:32,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:32,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:42:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:42:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:32,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:42:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:33,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 02:42:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:33,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:33,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 02:42:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:33,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-14 02:42:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 02:42:33,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:33,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277876658] [2024-10-14 02:42:33,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277876658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:33,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272012985] [2024-10-14 02:42:33,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:33,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:33,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:33,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:33,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 02:42:33,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:33,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 1405 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:42:33,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:33,409 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 02:42:33,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:33,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272012985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:33,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:33,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 18 [2024-10-14 02:42:33,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047538850] [2024-10-14 02:42:33,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:33,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:33,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:33,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:33,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:42:33,416 INFO L87 Difference]: Start difference. First operand 1568 states and 2520 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:42:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:34,137 INFO L93 Difference]: Finished difference Result 3131 states and 5185 transitions. [2024-10-14 02:42:34,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:34,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 115 [2024-10-14 02:42:34,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:34,147 INFO L225 Difference]: With dead ends: 3131 [2024-10-14 02:42:34,147 INFO L226 Difference]: Without dead ends: 1600 [2024-10-14 02:42:34,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:42:34,154 INFO L432 NwaCegarLoop]: 833 mSDtfsCounter, 822 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 2097 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:34,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 2097 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 02:42:34,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2024-10-14 02:42:34,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1600. [2024-10-14 02:42:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1227 states have (on average 1.6039119804400979) internal successors, (1968), 1256 states have internal predecessors, (1968), 285 states have call successors, (285), 91 states have call predecessors, (285), 87 states have return successors, (319), 268 states have call predecessors, (319), 281 states have call successors, (319) [2024-10-14 02:42:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2572 transitions. [2024-10-14 02:42:34,302 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2572 transitions. Word has length 115 [2024-10-14 02:42:34,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:34,302 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2572 transitions. [2024-10-14 02:42:34,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:42:34,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2572 transitions. [2024-10-14 02:42:34,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 02:42:34,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:34,305 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:34,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 02:42:34,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-14 02:42:34,507 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:34,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1993941631, now seen corresponding path program 1 times [2024-10-14 02:42:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:34,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260712167] [2024-10-14 02:42:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:34,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:42:35,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:42:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:42:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:42:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:42:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:42:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 02:42:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 02:42:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,152 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-14 02:42:35,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:35,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260712167] [2024-10-14 02:42:35,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260712167] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:35,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74124509] [2024-10-14 02:42:35,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:35,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:35,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:35,156 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:35,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 02:42:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:35,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 1408 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:42:35,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:35,512 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 02:42:35,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:35,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74124509] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:35,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:35,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-14 02:42:35,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001929005] [2024-10-14 02:42:35,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:35,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:35,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:35,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:35,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:42:35,513 INFO L87 Difference]: Start difference. First operand 1600 states and 2572 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:42:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:36,140 INFO L93 Difference]: Finished difference Result 3195 states and 5277 transitions. [2024-10-14 02:42:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:36,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 118 [2024-10-14 02:42:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:36,152 INFO L225 Difference]: With dead ends: 3195 [2024-10-14 02:42:36,153 INFO L226 Difference]: Without dead ends: 1632 [2024-10-14 02:42:36,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:42:36,162 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 813 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:36,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 2094 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 02:42:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2024-10-14 02:42:36,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1632. [2024-10-14 02:42:36,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1255 states have (on average 1.606374501992032) internal successors, (2016), 1284 states have internal predecessors, (2016), 285 states have call successors, (285), 95 states have call predecessors, (285), 91 states have return successors, (323), 268 states have call predecessors, (323), 281 states have call successors, (323) [2024-10-14 02:42:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2624 transitions. [2024-10-14 02:42:36,409 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2624 transitions. Word has length 118 [2024-10-14 02:42:36,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:36,409 INFO L471 AbstractCegarLoop]: Abstraction has 1632 states and 2624 transitions. [2024-10-14 02:42:36,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:42:36,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2624 transitions. [2024-10-14 02:42:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 02:42:36,413 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:36,413 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:36,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 02:42:36,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-14 02:42:36,614 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:36,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1063249158, now seen corresponding path program 1 times [2024-10-14 02:42:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:36,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614463958] [2024-10-14 02:42:36,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:36,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:36,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:36,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:36,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:42:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:42:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-10-14 02:42:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:42:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 02:42:37,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 02:42:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 02:42:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-14 02:42:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,337 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-14 02:42:37,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614463958] [2024-10-14 02:42:37,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614463958] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846580366] [2024-10-14 02:42:37,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:37,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:37,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:37,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:37,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 02:42:37,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:37,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 1411 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:42:37,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 02:42:37,683 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:37,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846580366] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:37,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:37,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-14 02:42:37,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62327746] [2024-10-14 02:42:37,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:37,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:37,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:37,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:37,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:42:37,685 INFO L87 Difference]: Start difference. First operand 1632 states and 2624 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:42:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:38,482 INFO L93 Difference]: Finished difference Result 3259 states and 5369 transitions. [2024-10-14 02:42:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:38,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 121 [2024-10-14 02:42:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:38,496 INFO L225 Difference]: With dead ends: 3259 [2024-10-14 02:42:38,496 INFO L226 Difference]: Without dead ends: 1664 [2024-10-14 02:42:38,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:42:38,506 INFO L432 NwaCegarLoop]: 827 mSDtfsCounter, 817 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:38,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 2091 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 02:42:38,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2024-10-14 02:42:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1664. [2024-10-14 02:42:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1283 states have (on average 1.6087295401402961) internal successors, (2064), 1312 states have internal predecessors, (2064), 285 states have call successors, (285), 99 states have call predecessors, (285), 95 states have return successors, (327), 268 states have call predecessors, (327), 281 states have call successors, (327) [2024-10-14 02:42:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2676 transitions. [2024-10-14 02:42:38,710 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2676 transitions. Word has length 121 [2024-10-14 02:42:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:38,710 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2676 transitions. [2024-10-14 02:42:38,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:42:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2676 transitions. [2024-10-14 02:42:38,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-14 02:42:38,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:38,713 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:38,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 02:42:38,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:38,914 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:38,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:38,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1796615315, now seen corresponding path program 1 times [2024-10-14 02:42:38,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:38,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182925015] [2024-10-14 02:42:38,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:38,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:42:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:39,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:42:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:42:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-14 02:42:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:42:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 02:42:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 02:42:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 02:42:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-14 02:42:39,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:39,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182925015] [2024-10-14 02:42:39,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182925015] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:39,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551164849] [2024-10-14 02:42:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:39,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:39,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:39,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:39,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 02:42:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:42:39,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:39,716 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 02:42:39,716 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:39,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551164849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:39,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:39,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 12 [2024-10-14 02:42:39,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663699941] [2024-10-14 02:42:39,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:39,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:39,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:39,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:39,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:42:39,718 INFO L87 Difference]: Start difference. First operand 1664 states and 2676 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:42:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:40,331 INFO L93 Difference]: Finished difference Result 3323 states and 5461 transitions. [2024-10-14 02:42:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:40,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 124 [2024-10-14 02:42:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:40,339 INFO L225 Difference]: With dead ends: 3323 [2024-10-14 02:42:40,340 INFO L226 Difference]: Without dead ends: 1696 [2024-10-14 02:42:40,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:42:40,345 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 796 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:40,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 2088 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 02:42:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2024-10-14 02:42:40,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1696. [2024-10-14 02:42:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1311 states have (on average 1.6109839816933638) internal successors, (2112), 1340 states have internal predecessors, (2112), 285 states have call successors, (285), 103 states have call predecessors, (285), 99 states have return successors, (331), 268 states have call predecessors, (331), 281 states have call successors, (331) [2024-10-14 02:42:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2728 transitions. [2024-10-14 02:42:40,544 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2728 transitions. Word has length 124 [2024-10-14 02:42:40,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:40,544 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2728 transitions. [2024-10-14 02:42:40,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:42:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2728 transitions. [2024-10-14 02:42:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 02:42:40,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:40,552 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:40,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 02:42:40,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:40,760 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:40,761 INFO L85 PathProgramCache]: Analyzing trace with hash -116163626, now seen corresponding path program 1 times [2024-10-14 02:42:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:40,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548046043] [2024-10-14 02:42:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:40,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:42:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:41,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 02:42:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:42:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 02:42:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:42:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:42:41,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 02:42:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 02:42:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:41,778 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 02:42:41,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:41,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548046043] [2024-10-14 02:42:41,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548046043] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:41,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493325405] [2024-10-14 02:42:41,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:41,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:41,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:41,780 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:41,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 02:42:42,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 1417 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 02:42:42,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:42:42,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:42,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493325405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:42,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:42,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2024-10-14 02:42:42,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837697581] [2024-10-14 02:42:42,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:42,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:42,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:42,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:42,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:42:42,195 INFO L87 Difference]: Start difference. First operand 1696 states and 2728 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-14 02:42:43,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:43,881 INFO L93 Difference]: Finished difference Result 3432 states and 5530 transitions. [2024-10-14 02:42:43,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:43,882 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 127 [2024-10-14 02:42:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:43,893 INFO L225 Difference]: With dead ends: 3432 [2024-10-14 02:42:43,893 INFO L226 Difference]: Without dead ends: 1776 [2024-10-14 02:42:43,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:42:43,899 INFO L432 NwaCegarLoop]: 372 mSDtfsCounter, 2074 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2187 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 2363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 547 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:43,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2187 Valid, 777 Invalid, 2363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [547 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 02:42:43,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-10-14 02:42:44,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1650. [2024-10-14 02:42:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1221 states have (on average 1.5757575757575757) internal successors, (1924), 1270 states have internal predecessors, (1924), 331 states have call successors, (331), 93 states have call predecessors, (331), 97 states have return successors, (377), 312 states have call predecessors, (377), 327 states have call successors, (377) [2024-10-14 02:42:44,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2632 transitions. [2024-10-14 02:42:44,101 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2632 transitions. Word has length 127 [2024-10-14 02:42:44,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:44,101 INFO L471 AbstractCegarLoop]: Abstraction has 1650 states and 2632 transitions. [2024-10-14 02:42:44,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 6 states have internal predecessors, (92), 6 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-14 02:42:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2632 transitions. [2024-10-14 02:42:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-14 02:42:44,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:44,104 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:44,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 02:42:44,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:44,309 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:44,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash -795435880, now seen corresponding path program 1 times [2024-10-14 02:42:44,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:44,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480411345] [2024-10-14 02:42:44,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:44,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:44,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:44,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:44,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:44,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:42:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 02:42:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:42:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 02:42:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:42:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:42:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 02:42:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 02:42:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-14 02:42:45,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:45,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480411345] [2024-10-14 02:42:45,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480411345] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:45,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568598668] [2024-10-14 02:42:45,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:45,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:45,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:45,267 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:42:45,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 02:42:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:45,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 1420 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 02:42:45,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-14 02:42:45,738 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:45,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568598668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:45,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:45,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2024-10-14 02:42:45,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271276481] [2024-10-14 02:42:45,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:45,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 02:42:45,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:45,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 02:42:45,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2024-10-14 02:42:45,744 INFO L87 Difference]: Start difference. First operand 1650 states and 2632 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-14 02:42:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:50,164 INFO L93 Difference]: Finished difference Result 7008 states and 11519 transitions. [2024-10-14 02:42:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 02:42:50,165 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) Word has length 127 [2024-10-14 02:42:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:50,196 INFO L225 Difference]: With dead ends: 7008 [2024-10-14 02:42:50,196 INFO L226 Difference]: Without dead ends: 5397 [2024-10-14 02:42:50,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2024-10-14 02:42:50,205 INFO L432 NwaCegarLoop]: 520 mSDtfsCounter, 2773 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 6159 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2877 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 6882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 6159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:50,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2877 Valid, 1948 Invalid, 6882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 6159 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-14 02:42:50,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5397 states. [2024-10-14 02:42:50,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5397 to 5017. [2024-10-14 02:42:50,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5017 states, 3690 states have (on average 1.5750677506775068) internal successors, (5812), 3844 states have internal predecessors, (5812), 1016 states have call successors, (1016), 261 states have call predecessors, (1016), 310 states have return successors, (1360), 988 states have call predecessors, (1360), 1008 states have call successors, (1360) [2024-10-14 02:42:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5017 states to 5017 states and 8188 transitions. [2024-10-14 02:42:50,837 INFO L78 Accepts]: Start accepts. Automaton has 5017 states and 8188 transitions. Word has length 127 [2024-10-14 02:42:50,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:50,837 INFO L471 AbstractCegarLoop]: Abstraction has 5017 states and 8188 transitions. [2024-10-14 02:42:50,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 4 states have call successors, (17), 4 states have call predecessors, (17), 5 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16) [2024-10-14 02:42:50,837 INFO L276 IsEmpty]: Start isEmpty. Operand 5017 states and 8188 transitions. [2024-10-14 02:42:50,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 02:42:50,840 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:50,840 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:50,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 02:42:51,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:51,041 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:51,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:51,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1645054409, now seen corresponding path program 1 times [2024-10-14 02:42:51,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:51,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617289743] [2024-10-14 02:42:51,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:51,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:42:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:51,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 02:42:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:42:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-14 02:42:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:42:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 02:42:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 02:42:51,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-14 02:42:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,625 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-10-14 02:42:51,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617289743] [2024-10-14 02:42:51,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617289743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:51,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:51,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:42:51,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370425486] [2024-10-14 02:42:51,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:51,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:42:51,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:51,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:42:51,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:42:51,627 INFO L87 Difference]: Start difference. First operand 5017 states and 8188 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 6 states have internal predecessors, (73), 4 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (16), 5 states have call predecessors, (16), 4 states have call successors, (16)