./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_product31.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_product31.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 866b4070887ce539f36e137c6ed6e587ee3f43d9563c34ef0dd3382aa4e2313a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:41:35,673 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:41:35,743 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:35,747 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:41:35,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:41:35,785 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:41:35,787 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:41:35,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:41:35,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:41:35,789 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:41:35,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:41:35,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:41:35,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:41:35,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:41:35,793 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:41:35,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:41:35,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:41:35,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:41:35,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:41:35,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:41:35,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:41:35,798 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:41:35,798 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:41:35,798 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:41:35,798 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:41:35,799 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:41:35,799 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:41:35,799 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:41:35,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:41:35,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:41:35,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:41:35,800 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:41:35,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:41:35,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:41:35,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:41:35,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:41:35,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:41:35,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:41:35,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:41:35,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:41:35,803 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:41:35,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:41:35,804 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 -> 866b4070887ce539f36e137c6ed6e587ee3f43d9563c34ef0dd3382aa4e2313a [2024-10-14 02:41:36,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:41:36,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:41:36,125 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:41:36,127 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:41:36,128 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:41:36,129 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product31.cil.c [2024-10-14 02:41:37,531 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:41:37,841 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:41:37,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/elevator_spec14_product31.cil.c [2024-10-14 02:41:37,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2da41d976/b7ea98692eba487e8cc1a2c436859aad/FLAG8761945ab [2024-10-14 02:41:37,888 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2da41d976/b7ea98692eba487e8cc1a2c436859aad [2024-10-14 02:41:37,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:41:37,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:41:37,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:41:37,894 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:41:37,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:41:37,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:41:37" (1/1) ... [2024-10-14 02:41:37,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa02623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:37, skipping insertion in model container [2024-10-14 02:41:37,902 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:41:37" (1/1) ... [2024-10-14 02:41:37,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:41:38,472 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_product31.cil.c[71150,71163] [2024-10-14 02:41:38,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:41:38,495 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:41:38,504 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Floor.i","") [48] [2024-10-14 02:41:38,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [716] [2024-10-14 02:41:38,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"UnitTests.i","") [1082] [2024-10-14 02:41:38,506 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1183] [2024-10-14 02:41:38,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Person.i","") [1221] [2024-10-14 02:41:38,507 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Elevator.i","") [1341] [2024-10-14 02:41:38,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2956] [2024-10-14 02:41:38,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Specification14_spec.i","") [3305] [2024-10-14 02:41:38,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3342] [2024-10-14 02:41:38,508 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [3351] [2024-10-14 02:41:38,587 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_product31.cil.c[71150,71163] [2024-10-14 02:41:38,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:41:38,621 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:41:38,621 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:38 WrapperNode [2024-10-14 02:41:38,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:41:38,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:41:38,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:41:38,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:41:38,628 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:38" (1/1) ... [2024-10-14 02:41:38,652 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:38" (1/1) ... [2024-10-14 02:41:38,713 INFO L138 Inliner]: procedures = 94, calls = 342, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 897 [2024-10-14 02:41:38,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:41:38,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:41:38,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:41:38,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:41:38,727 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:38" (1/1) ... [2024-10-14 02:41:38,727 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:38" (1/1) ... [2024-10-14 02:41:38,734 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:38" (1/1) ... [2024-10-14 02:41:38,761 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:38,761 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:38" (1/1) ... [2024-10-14 02:41:38,762 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:38" (1/1) ... [2024-10-14 02:41:38,781 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:38" (1/1) ... [2024-10-14 02:41:38,794 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:38" (1/1) ... [2024-10-14 02:41:38,800 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:38" (1/1) ... [2024-10-14 02:41:38,806 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:38" (1/1) ... [2024-10-14 02:41:38,816 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:41:38,817 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:41:38,817 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:41:38,817 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:41:38,818 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:38" (1/1) ... [2024-10-14 02:41:38,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:41:38,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:41:38,868 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:38,874 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:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:41:38,961 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-14 02:41:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2024-10-14 02:41:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2024-10-14 02:41:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2024-10-14 02:41:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2024-10-14 02:41:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2024-10-14 02:41:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2024-10-14 02:41:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2024-10-14 02:41:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2024-10-14 02:41:38,962 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2024-10-14 02:41:38,962 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2024-10-14 02:41:38,963 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2024-10-14 02:41:38,963 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2024-10-14 02:41:38,963 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2024-10-14 02:41:38,963 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2024-10-14 02:41:38,963 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2024-10-14 02:41:38,963 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:41:38,963 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2024-10-14 02:41:38,963 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2024-10-14 02:41:38,963 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2024-10-14 02:41:38,963 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2024-10-14 02:41:38,963 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2024-10-14 02:41:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2024-10-14 02:41:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2024-10-14 02:41:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2024-10-14 02:41:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2024-10-14 02:41:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2024-10-14 02:41:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2024-10-14 02:41:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2024-10-14 02:41:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2024-10-14 02:41:38,964 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2024-10-14 02:41:38,964 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2024-10-14 02:41:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2024-10-14 02:41:38,965 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2024-10-14 02:41:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2024-10-14 02:41:38,965 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2024-10-14 02:41:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2024-10-14 02:41:38,965 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2024-10-14 02:41:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2024-10-14 02:41:38,965 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2024-10-14 02:41:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:41:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:41:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:41:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:41:38,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-14 02:41:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-14 02:41:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-14 02:41:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-14 02:41:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-14 02:41:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-14 02:41:38,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-14 02:41:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-14 02:41:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-14 02:41:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-14 02:41:38,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-14 02:41:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2024-10-14 02:41:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2024-10-14 02:41:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2024-10-14 02:41:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2024-10-14 02:41:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2024-10-14 02:41:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2024-10-14 02:41:38,971 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2024-10-14 02:41:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2024-10-14 02:41:38,971 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2024-10-14 02:41:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2024-10-14 02:41:38,971 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2024-10-14 02:41:38,971 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2024-10-14 02:41:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2024-10-14 02:41:38,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:41:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:41:38,972 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2024-10-14 02:41:38,972 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2024-10-14 02:41:39,248 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:41:39,252 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:41:40,461 INFO L? ?]: Removed 474 outVars from TransFormulas that were not future-live. [2024-10-14 02:41:40,461 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:41:40,555 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:41:40,559 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:41:40,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:41:40 BoogieIcfgContainer [2024-10-14 02:41:40,560 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:41:40,564 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:41:40,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:41:40,568 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:41:40,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:41:37" (1/3) ... [2024-10-14 02:41:40,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4debeacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:41:40, skipping insertion in model container [2024-10-14 02:41:40,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:41:38" (2/3) ... [2024-10-14 02:41:40,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4debeacf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:41:40, skipping insertion in model container [2024-10-14 02:41:40,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:41:40" (3/3) ... [2024-10-14 02:41:40,573 INFO L112 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product31.cil.c [2024-10-14 02:41:40,593 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:41:40,593 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:41:40,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:41:40,706 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;@34e90301, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:41:40,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:41:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 546 states, 420 states have (on average 1.7023809523809523) internal successors, (715), 436 states have internal predecessors, (715), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) [2024-10-14 02:41:40,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 02:41:40,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:40,740 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:40,741 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:40,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:40,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1945756511, now seen corresponding path program 1 times [2024-10-14 02:41:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:40,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855135758] [2024-10-14 02:41:40,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:40,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:40,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:41,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 02:41:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:41:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:41:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:41:41,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:41:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:41:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:41:41,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:41,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:41,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855135758] [2024-10-14 02:41:41,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855135758] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:41,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:41,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:41,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045240944] [2024-10-14 02:41:41,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:41,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:41,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:41,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:41,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:41,655 INFO L87 Difference]: Start difference. First operand has 546 states, 420 states have (on average 1.7023809523809523) internal successors, (715), 436 states have internal predecessors, (715), 99 states have call successors, (99), 25 states have call predecessors, (99), 25 states have return successors, (99), 97 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:46,381 INFO L93 Difference]: Finished difference Result 1279 states and 2172 transitions. [2024-10-14 02:41:46,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:41:46,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2024-10-14 02:41:46,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:46,420 INFO L225 Difference]: With dead ends: 1279 [2024-10-14 02:41:46,421 INFO L226 Difference]: Without dead ends: 727 [2024-10-14 02:41:46,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:41:46,437 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1381 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 2585 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 2585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:46,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 1051 Invalid, 2990 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [405 Valid, 2585 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-14 02:41:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-14 02:41:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 545. [2024-10-14 02:41:46,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 420 states have (on average 1.6857142857142857) internal successors, (708), 435 states have internal predecessors, (708), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-14 02:41:46,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 905 transitions. [2024-10-14 02:41:46,645 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 905 transitions. Word has length 89 [2024-10-14 02:41:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:46,647 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 905 transitions. [2024-10-14 02:41:46,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 905 transitions. [2024-10-14 02:41:46,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 02:41:46,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:46,656 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:46,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:41:46,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:46,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:46,658 INFO L85 PathProgramCache]: Analyzing trace with hash 293079729, now seen corresponding path program 1 times [2024-10-14 02:41:46,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:46,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296335072] [2024-10-14 02:41:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:46,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:46,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:46,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:46,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:41:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 02:41:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:41:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:41:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:47,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:41:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:41:47,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:41:47,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:47,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:47,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296335072] [2024-10-14 02:41:47,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296335072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:47,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:47,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701871710] [2024-10-14 02:41:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:47,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:47,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:47,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:47,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:47,077 INFO L87 Difference]: Start difference. First operand 545 states and 905 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:50,768 INFO L93 Difference]: Finished difference Result 1260 states and 2106 transitions. [2024-10-14 02:41:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:41:50,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 90 [2024-10-14 02:41:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:50,775 INFO L225 Difference]: With dead ends: 1260 [2024-10-14 02:41:50,776 INFO L226 Difference]: Without dead ends: 727 [2024-10-14 02:41:50,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:41:50,780 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1362 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 2976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:50,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 1018 Invalid, 2976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:41:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-14 02:41:50,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 545. [2024-10-14 02:41:50,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 420 states have (on average 1.6833333333333333) internal successors, (707), 435 states have internal predecessors, (707), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-14 02:41:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 904 transitions. [2024-10-14 02:41:50,888 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 904 transitions. Word has length 90 [2024-10-14 02:41:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:50,888 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 904 transitions. [2024-10-14 02:41:50,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 904 transitions. [2024-10-14 02:41:50,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 02:41:50,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:50,893 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:50,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:41:50,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:50,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:50,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1045547869, now seen corresponding path program 1 times [2024-10-14 02:41:50,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:50,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418319168] [2024-10-14 02:41:50,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-14 02:41:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 02:41:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:41:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:41:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:51,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 02:41:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:41:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 02:41:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:51,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:51,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418319168] [2024-10-14 02:41:51,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418319168] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:51,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:51,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:51,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349676545] [2024-10-14 02:41:51,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:51,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:51,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:51,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:51,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:51,238 INFO L87 Difference]: Start difference. First operand 545 states and 904 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:54,420 INFO L93 Difference]: Finished difference Result 1260 states and 2105 transitions. [2024-10-14 02:41:54,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:41:54,421 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 91 [2024-10-14 02:41:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:54,426 INFO L225 Difference]: With dead ends: 1260 [2024-10-14 02:41:54,426 INFO L226 Difference]: Without dead ends: 727 [2024-10-14 02:41:54,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:41:54,430 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1351 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 2988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:54,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1398 Valid, 1041 Invalid, 2988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 02:41:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-14 02:41:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 545. [2024-10-14 02:41:54,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 420 states have (on average 1.680952380952381) internal successors, (706), 435 states have internal predecessors, (706), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-14 02:41:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 903 transitions. [2024-10-14 02:41:54,541 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 903 transitions. Word has length 91 [2024-10-14 02:41:54,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:54,542 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 903 transitions. [2024-10-14 02:41:54,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:54,542 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 903 transitions. [2024-10-14 02:41:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 02:41:54,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:54,545 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:54,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 02:41:54,546 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:54,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:54,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1238585355, now seen corresponding path program 1 times [2024-10-14 02:41:54,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:54,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431716696] [2024-10-14 02:41:54,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:54,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:54,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-14 02:41:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:41:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-14 02:41:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 02:41:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 02:41:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:41:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 02:41:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:54,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:54,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431716696] [2024-10-14 02:41:54,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431716696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:54,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:54,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:54,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828798679] [2024-10-14 02:41:54,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:54,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:54,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:54,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:54,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:54,844 INFO L87 Difference]: Start difference. First operand 545 states and 903 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:41:58,227 INFO L93 Difference]: Finished difference Result 1260 states and 2104 transitions. [2024-10-14 02:41:58,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:41:58,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2024-10-14 02:41:58,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:41:58,232 INFO L225 Difference]: With dead ends: 1260 [2024-10-14 02:41:58,232 INFO L226 Difference]: Without dead ends: 727 [2024-10-14 02:41:58,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:41:58,236 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1350 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 2576 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 2576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:41:58,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 1040 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 2576 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 02:41:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-14 02:41:58,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 545. [2024-10-14 02:41:58,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 420 states have (on average 1.6785714285714286) internal successors, (705), 435 states have internal predecessors, (705), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-14 02:41:58,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 902 transitions. [2024-10-14 02:41:58,322 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 902 transitions. Word has length 92 [2024-10-14 02:41:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:41:58,322 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 902 transitions. [2024-10-14 02:41:58,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:41:58,323 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 902 transitions. [2024-10-14 02:41:58,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 02:41:58,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:41:58,326 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:41:58,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 02:41:58,326 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:41:58,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:41:58,327 INFO L85 PathProgramCache]: Analyzing trace with hash -278067737, now seen corresponding path program 1 times [2024-10-14 02:41:58,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:41:58,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983094209] [2024-10-14 02:41:58,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:41:58,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:41:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:41:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-14 02:41:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:41:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 02:41:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 02:41:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:41:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 02:41:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:41:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:41:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:41:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:41:58,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:41:58,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:41:58,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983094209] [2024-10-14 02:41:58,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983094209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:41:58,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:41:58,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:41:58,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499435534] [2024-10-14 02:41:58,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:41:58,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:41:58,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:41:58,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:41:58,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:41:58,761 INFO L87 Difference]: Start difference. First operand 545 states and 902 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:01,761 INFO L93 Difference]: Finished difference Result 1260 states and 2103 transitions. [2024-10-14 02:42:01,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:42:01,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2024-10-14 02:42:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:01,767 INFO L225 Difference]: With dead ends: 1260 [2024-10-14 02:42:01,768 INFO L226 Difference]: Without dead ends: 727 [2024-10-14 02:42:01,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:42:01,774 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1348 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1395 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:01,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1395 Valid, 1034 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 02:42:01,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-14 02:42:01,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 545. [2024-10-14 02:42:01,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 420 states have (on average 1.6761904761904762) internal successors, (704), 435 states have internal predecessors, (704), 99 states have call successors, (99), 26 states have call predecessors, (99), 25 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-14 02:42:01,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 901 transitions. [2024-10-14 02:42:01,876 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 901 transitions. Word has length 93 [2024-10-14 02:42:01,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:01,876 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 901 transitions. [2024-10-14 02:42:01,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:01,876 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 901 transitions. [2024-10-14 02:42:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 02:42:01,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:01,881 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:01,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 02:42:01,881 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:01,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2082919737, now seen corresponding path program 1 times [2024-10-14 02:42:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:01,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592388838] [2024-10-14 02:42:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:01,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:02,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:42:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 02:42:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:42:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:42:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:42:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:42:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:02,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:02,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592388838] [2024-10-14 02:42:02,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592388838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:02,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:02,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:42:02,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041705907] [2024-10-14 02:42:02,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:02,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:42:02,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:02,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:42:02,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:42:02,347 INFO L87 Difference]: Start difference. First operand 545 states and 901 transitions. Second operand has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:06,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:06,995 INFO L93 Difference]: Finished difference Result 1280 states and 2137 transitions. [2024-10-14 02:42:06,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 02:42:06,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 94 [2024-10-14 02:42:06,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:07,001 INFO L225 Difference]: With dead ends: 1280 [2024-10-14 02:42:07,001 INFO L226 Difference]: Without dead ends: 751 [2024-10-14 02:42:07,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2024-10-14 02:42:07,004 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 1462 mSDsluCounter, 1553 mSDsCounter, 0 mSdLazyCounter, 4979 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1509 SdHoareTripleChecker+Valid, 1851 SdHoareTripleChecker+Invalid, 5386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 4979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:07,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1509 Valid, 1851 Invalid, 5386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 4979 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-14 02:42:07,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-10-14 02:42:07,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 557. [2024-10-14 02:42:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 429 states have (on average 1.6736596736596736) internal successors, (718), 446 states have internal predecessors, (718), 100 states have call successors, (100), 26 states have call predecessors, (100), 27 states have return successors, (102), 97 states have call predecessors, (102), 99 states have call successors, (102) [2024-10-14 02:42:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 920 transitions. [2024-10-14 02:42:07,112 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 920 transitions. Word has length 94 [2024-10-14 02:42:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:07,113 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 920 transitions. [2024-10-14 02:42:07,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.625) internal successors, (53), 6 states have internal predecessors, (53), 3 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:07,113 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 920 transitions. [2024-10-14 02:42:07,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 02:42:07,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:07,116 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:07,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:42:07,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:07,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash 597864186, now seen corresponding path program 1 times [2024-10-14 02:42:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:07,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398179007] [2024-10-14 02:42:07,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:07,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:07,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:42:07,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-14 02:42:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:42:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:42:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:42:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:42:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:07,404 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:07,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:07,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398179007] [2024-10-14 02:42:07,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398179007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:07,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:07,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:42:07,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436370761] [2024-10-14 02:42:07,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:07,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:07,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:07,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:07,407 INFO L87 Difference]: Start difference. First operand 557 states and 920 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:10,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:10,862 INFO L93 Difference]: Finished difference Result 1331 states and 2225 transitions. [2024-10-14 02:42:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:42:10,863 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 94 [2024-10-14 02:42:10,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:10,868 INFO L225 Difference]: With dead ends: 1331 [2024-10-14 02:42:10,868 INFO L226 Difference]: Without dead ends: 794 [2024-10-14 02:42:10,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:42:10,875 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1437 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 2995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:10,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 1009 Invalid, 2995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 02:42:10,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2024-10-14 02:42:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 576. [2024-10-14 02:42:10,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 447 states have (on average 1.6689038031319912) internal successors, (746), 464 states have internal predecessors, (746), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-14 02:42:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 947 transitions. [2024-10-14 02:42:10,985 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 947 transitions. Word has length 94 [2024-10-14 02:42:10,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:10,986 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 947 transitions. [2024-10-14 02:42:10,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:10,986 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 947 transitions. [2024-10-14 02:42:10,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 02:42:10,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:10,990 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:10,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:42:10,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:10,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:10,991 INFO L85 PathProgramCache]: Analyzing trace with hash -22081205, now seen corresponding path program 1 times [2024-10-14 02:42:10,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:10,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298055228] [2024-10-14 02:42:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:10,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 02:42:11,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 02:42:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:42:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:42:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:42:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:42:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:11,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:11,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298055228] [2024-10-14 02:42:11,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298055228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:11,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:11,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:42:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491230858] [2024-10-14 02:42:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:11,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:11,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:11,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:11,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:11,308 INFO L87 Difference]: Start difference. First operand 576 states and 947 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:14,357 INFO L93 Difference]: Finished difference Result 1306 states and 2160 transitions. [2024-10-14 02:42:14,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:42:14,358 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 95 [2024-10-14 02:42:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:14,362 INFO L225 Difference]: With dead ends: 1306 [2024-10-14 02:42:14,362 INFO L226 Difference]: Without dead ends: 786 [2024-10-14 02:42:14,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:42:14,364 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1404 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 2579 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1451 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 2983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 2579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:14,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1451 Valid, 1039 Invalid, 2983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 2579 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 02:42:14,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-10-14 02:42:14,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 576. [2024-10-14 02:42:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 447 states have (on average 1.657718120805369) internal successors, (741), 464 states have internal predecessors, (741), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-14 02:42:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 942 transitions. [2024-10-14 02:42:14,483 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 942 transitions. Word has length 95 [2024-10-14 02:42:14,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:14,483 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 942 transitions. [2024-10-14 02:42:14,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:14,483 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 942 transitions. [2024-10-14 02:42:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 02:42:14,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:14,487 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:14,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:42:14,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:14,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash -811410443, now seen corresponding path program 1 times [2024-10-14 02:42:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:14,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982444561] [2024-10-14 02:42:14,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 02:42:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:42:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:42:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:42:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 02:42:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:42:14,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:14,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:14,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982444561] [2024-10-14 02:42:14,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982444561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:14,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:14,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:42:14,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939376404] [2024-10-14 02:42:14,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:14,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:14,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:14,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:14,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:14,777 INFO L87 Difference]: Start difference. First operand 576 states and 942 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:17,756 INFO L93 Difference]: Finished difference Result 1306 states and 2155 transitions. [2024-10-14 02:42:17,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:42:17,757 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2024-10-14 02:42:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:17,762 INFO L225 Difference]: With dead ends: 1306 [2024-10-14 02:42:17,762 INFO L226 Difference]: Without dead ends: 786 [2024-10-14 02:42:17,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:42:17,765 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 1412 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 2540 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 2948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 2540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:17,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 991 Invalid, 2948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 2540 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 02:42:17,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-10-14 02:42:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 576. [2024-10-14 02:42:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 447 states have (on average 1.6465324384787472) internal successors, (736), 464 states have internal predecessors, (736), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-14 02:42:17,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 937 transitions. [2024-10-14 02:42:17,873 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 937 transitions. Word has length 96 [2024-10-14 02:42:17,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:17,874 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 937 transitions. [2024-10-14 02:42:17,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 937 transitions. [2024-10-14 02:42:17,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 02:42:17,877 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:17,878 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:17,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:42:17,878 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:17,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:17,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1108898886, now seen corresponding path program 1 times [2024-10-14 02:42:17,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:17,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960132301] [2024-10-14 02:42:17,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:17,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:42:18,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:42:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:42:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:42:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:42:18,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:42:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:18,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:18,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960132301] [2024-10-14 02:42:18,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960132301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:18,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:18,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:42:18,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067750476] [2024-10-14 02:42:18,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:18,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:42:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:18,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:42:18,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:42:18,241 INFO L87 Difference]: Start difference. First operand 576 states and 937 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:22,569 INFO L93 Difference]: Finished difference Result 1286 states and 2116 transitions. [2024-10-14 02:42:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 02:42:22,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2024-10-14 02:42:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:22,574 INFO L225 Difference]: With dead ends: 1286 [2024-10-14 02:42:22,574 INFO L226 Difference]: Without dead ends: 780 [2024-10-14 02:42:22,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:42:22,577 INFO L432 NwaCegarLoop]: 305 mSDtfsCounter, 1393 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 4852 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 5258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 4852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:22,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 1897 Invalid, 5258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 4852 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 02:42:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2024-10-14 02:42:22,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 578. [2024-10-14 02:42:22,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 449 states have (on average 1.641425389755011) internal successors, (737), 466 states have internal predecessors, (737), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-14 02:42:22,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 938 transitions. [2024-10-14 02:42:22,687 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 938 transitions. Word has length 97 [2024-10-14 02:42:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:22,687 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 938 transitions. [2024-10-14 02:42:22,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 938 transitions. [2024-10-14 02:42:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-14 02:42:22,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:22,690 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:22,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 02:42:22,691 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:22,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:22,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1738295654, now seen corresponding path program 1 times [2024-10-14 02:42:22,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:22,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304286514] [2024-10-14 02:42:22,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:22,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 02:42:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:42:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:42:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:42:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:42:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:42:22,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:22,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:22,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304286514] [2024-10-14 02:42:22,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304286514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:22,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:22,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:42:22,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878884559] [2024-10-14 02:42:22,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:22,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:22,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:22,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:22,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:22,950 INFO L87 Difference]: Start difference. First operand 578 states and 938 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:25,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:26,000 INFO L93 Difference]: Finished difference Result 1310 states and 2149 transitions. [2024-10-14 02:42:26,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:42:26,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 97 [2024-10-14 02:42:26,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:26,006 INFO L225 Difference]: With dead ends: 1310 [2024-10-14 02:42:26,006 INFO L226 Difference]: Without dead ends: 788 [2024-10-14 02:42:26,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:42:26,008 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 1400 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 2532 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1447 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 2532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:26,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1447 Valid, 1006 Invalid, 2938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 2532 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-14 02:42:26,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-14 02:42:26,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 578. [2024-10-14 02:42:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 449 states have (on average 1.6302895322939865) internal successors, (732), 466 states have internal predecessors, (732), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-14 02:42:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 933 transitions. [2024-10-14 02:42:26,116 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 933 transitions. Word has length 97 [2024-10-14 02:42:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:26,117 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 933 transitions. [2024-10-14 02:42:26,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 933 transitions. [2024-10-14 02:42:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 02:42:26,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:26,120 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:26,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:42:26,120 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:26,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1500248658, now seen corresponding path program 1 times [2024-10-14 02:42:26,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:26,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817132682] [2024-10-14 02:42:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:26,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:42:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:42:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:42:26,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:26,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:42:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:42:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:42:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:26,477 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:26,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:26,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817132682] [2024-10-14 02:42:26,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817132682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:26,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:26,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:42:26,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680519355] [2024-10-14 02:42:26,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:26,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:42:26,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:26,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:42:26,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:42:26,479 INFO L87 Difference]: Start difference. First operand 578 states and 933 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:30,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:30,551 INFO L93 Difference]: Finished difference Result 1299 states and 2123 transitions. [2024-10-14 02:42:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 02:42:30,552 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 98 [2024-10-14 02:42:30,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:30,556 INFO L225 Difference]: With dead ends: 1299 [2024-10-14 02:42:30,556 INFO L226 Difference]: Without dead ends: 789 [2024-10-14 02:42:30,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:42:30,559 INFO L432 NwaCegarLoop]: 313 mSDtfsCounter, 1381 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 4819 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 5225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 4819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:30,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 1946 Invalid, 5225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 4819 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 02:42:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-10-14 02:42:30,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 584. [2024-10-14 02:42:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 455 states have (on average 1.6197802197802198) internal successors, (737), 472 states have internal predecessors, (737), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-14 02:42:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 938 transitions. [2024-10-14 02:42:30,671 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 938 transitions. Word has length 98 [2024-10-14 02:42:30,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:30,672 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 938 transitions. [2024-10-14 02:42:30,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 6 states have internal predecessors, (57), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:30,672 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 938 transitions. [2024-10-14 02:42:30,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-14 02:42:30,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:30,675 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:30,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:42:30,675 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:30,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:30,675 INFO L85 PathProgramCache]: Analyzing trace with hash 423914736, now seen corresponding path program 1 times [2024-10-14 02:42:30,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146690339] [2024-10-14 02:42:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:30,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:42:30,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:42:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:42:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:42:30,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:42:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:42:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:30,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:30,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146690339] [2024-10-14 02:42:30,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146690339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:30,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:30,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:42:30,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224816129] [2024-10-14 02:42:30,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:30,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:30,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:30,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:30,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:30,925 INFO L87 Difference]: Start difference. First operand 584 states and 938 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:33,938 INFO L93 Difference]: Finished difference Result 1325 states and 2154 transitions. [2024-10-14 02:42:33,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:42:33,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2024-10-14 02:42:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:33,944 INFO L225 Difference]: With dead ends: 1325 [2024-10-14 02:42:33,944 INFO L226 Difference]: Without dead ends: 797 [2024-10-14 02:42:33,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:42:33,948 INFO L432 NwaCegarLoop]: 311 mSDtfsCounter, 1387 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 2506 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 2506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:33,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 1033 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 2506 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 02:42:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2024-10-14 02:42:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 584. [2024-10-14 02:42:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 455 states have (on average 1.6087912087912088) internal successors, (732), 472 states have internal predecessors, (732), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-14 02:42:34,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 933 transitions. [2024-10-14 02:42:34,089 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 933 transitions. Word has length 98 [2024-10-14 02:42:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:34,090 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 933 transitions. [2024-10-14 02:42:34,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 933 transitions. [2024-10-14 02:42:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 02:42:34,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:34,093 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:34,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 02:42:34,093 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:34,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:34,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1329720479, now seen corresponding path program 1 times [2024-10-14 02:42:34,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:34,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356629660] [2024-10-14 02:42:34,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:34,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:34,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:42:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:42:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:42:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:42:34,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:42:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:42:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:34,419 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:34,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:34,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356629660] [2024-10-14 02:42:34,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356629660] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:34,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:34,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:42:34,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575939028] [2024-10-14 02:42:34,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:34,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:42:34,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:34,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:42:34,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:42:34,421 INFO L87 Difference]: Start difference. First operand 584 states and 933 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:38,598 INFO L93 Difference]: Finished difference Result 1314 states and 2130 transitions. [2024-10-14 02:42:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 02:42:38,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2024-10-14 02:42:38,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:38,602 INFO L225 Difference]: With dead ends: 1314 [2024-10-14 02:42:38,602 INFO L226 Difference]: Without dead ends: 801 [2024-10-14 02:42:38,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:42:38,605 INFO L432 NwaCegarLoop]: 314 mSDtfsCounter, 1371 mSDsluCounter, 1638 mSDsCounter, 0 mSdLazyCounter, 4796 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 5204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 4796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:38,605 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1418 Valid, 1952 Invalid, 5204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 4796 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-14 02:42:38,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2024-10-14 02:42:38,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 592. [2024-10-14 02:42:38,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 463 states have (on average 1.5961123110151187) internal successors, (739), 480 states have internal predecessors, (739), 100 states have call successors, (100), 27 states have call predecessors, (100), 28 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2024-10-14 02:42:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 940 transitions. [2024-10-14 02:42:38,708 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 940 transitions. Word has length 99 [2024-10-14 02:42:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:38,709 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 940 transitions. [2024-10-14 02:42:38,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:38,709 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 940 transitions. [2024-10-14 02:42:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-14 02:42:38,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:38,712 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:38,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 02:42:38,713 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:38,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:38,713 INFO L85 PathProgramCache]: Analyzing trace with hash -418079359, now seen corresponding path program 1 times [2024-10-14 02:42:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:38,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635812497] [2024-10-14 02:42:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:38,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:38,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:38,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:42:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 02:42:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:42:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:42:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:42:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:38,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:42:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:39,000 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:39,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:39,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635812497] [2024-10-14 02:42:39,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635812497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:39,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:39,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:42:39,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460614191] [2024-10-14 02:42:39,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:39,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:39,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:39,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:39,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:39,002 INFO L87 Difference]: Start difference. First operand 592 states and 940 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:42,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:42,243 INFO L93 Difference]: Finished difference Result 1369 states and 2194 transitions. [2024-10-14 02:42:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:42:42,244 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-10-14 02:42:42,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:42,247 INFO L225 Difference]: With dead ends: 1369 [2024-10-14 02:42:42,248 INFO L226 Difference]: Without dead ends: 771 [2024-10-14 02:42:42,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:42:42,251 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1331 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 2876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:42,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 1030 Invalid, 2876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 02:42:42,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2024-10-14 02:42:42,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 574. [2024-10-14 02:42:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 448 states have (on average 1.6004464285714286) internal successors, (717), 463 states have internal predecessors, (717), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-14 02:42:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 914 transitions. [2024-10-14 02:42:42,368 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 914 transitions. Word has length 99 [2024-10-14 02:42:42,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:42,369 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 914 transitions. [2024-10-14 02:42:42,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 914 transitions. [2024-10-14 02:42:42,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-14 02:42:42,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:42,372 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:42,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 02:42:42,372 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:42,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:42,374 INFO L85 PathProgramCache]: Analyzing trace with hash -941360691, now seen corresponding path program 1 times [2024-10-14 02:42:42,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:42,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619093426] [2024-10-14 02:42:42,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:42,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:42:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-14 02:42:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:42:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:42,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:42:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:42:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 02:42:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:42,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:42,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619093426] [2024-10-14 02:42:42,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619093426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:42,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:42,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:42:42,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372887494] [2024-10-14 02:42:42,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:42,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:42:42,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:42,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:42:42,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:42:42,699 INFO L87 Difference]: Start difference. First operand 574 states and 914 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:46,867 INFO L93 Difference]: Finished difference Result 1301 states and 2101 transitions. [2024-10-14 02:42:46,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 02:42:46,868 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2024-10-14 02:42:46,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:46,872 INFO L225 Difference]: With dead ends: 1301 [2024-10-14 02:42:46,872 INFO L226 Difference]: Without dead ends: 786 [2024-10-14 02:42:46,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2024-10-14 02:42:46,875 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 1339 mSDsluCounter, 1694 mSDsCounter, 0 mSdLazyCounter, 4728 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1386 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 5130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 4728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:46,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1386 Valid, 2017 Invalid, 5130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 4728 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 02:42:46,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-10-14 02:42:46,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 584. [2024-10-14 02:42:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 458 states have (on average 1.5873362445414847) internal successors, (727), 473 states have internal predecessors, (727), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-14 02:42:46,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 924 transitions. [2024-10-14 02:42:46,977 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 924 transitions. Word has length 100 [2024-10-14 02:42:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:46,977 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 924 transitions. [2024-10-14 02:42:46,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 6 states have internal predecessors, (59), 3 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-14 02:42:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 924 transitions. [2024-10-14 02:42:46,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 02:42:46,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:46,980 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:46,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 02:42:46,981 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:46,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:46,981 INFO L85 PathProgramCache]: Analyzing trace with hash 14589806, now seen corresponding path program 1 times [2024-10-14 02:42:46,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:46,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143653308] [2024-10-14 02:42:46,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:46,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 02:42:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:42:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:42:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:42:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:42:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:47,249 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-14 02:42:47,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:47,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143653308] [2024-10-14 02:42:47,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143653308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:47,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:42:47,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:42:47,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174579101] [2024-10-14 02:42:47,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:47,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:42:47,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:47,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:42:47,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:42:47,251 INFO L87 Difference]: Start difference. First operand 584 states and 924 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:50,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:50,419 INFO L93 Difference]: Finished difference Result 1318 states and 2113 transitions. [2024-10-14 02:42:50,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 02:42:50,420 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2024-10-14 02:42:50,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:50,426 INFO L225 Difference]: With dead ends: 1318 [2024-10-14 02:42:50,426 INFO L226 Difference]: Without dead ends: 778 [2024-10-14 02:42:50,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:42:50,430 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 1393 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 2461 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1440 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 2461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:50,430 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1440 Valid, 1009 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 2461 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 02:42:50,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2024-10-14 02:42:50,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 584. [2024-10-14 02:42:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 584 states, 458 states have (on average 1.5786026200873362) internal successors, (723), 473 states have internal predecessors, (723), 99 states have call successors, (99), 27 states have call predecessors, (99), 26 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2024-10-14 02:42:50,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 920 transitions. [2024-10-14 02:42:50,545 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 920 transitions. Word has length 101 [2024-10-14 02:42:50,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:50,545 INFO L471 AbstractCegarLoop]: Abstraction has 584 states and 920 transitions. [2024-10-14 02:42:50,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 02:42:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 920 transitions. [2024-10-14 02:42:50,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-14 02:42:50,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:50,548 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:50,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 02:42:50,549 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:50,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash -12475796, now seen corresponding path program 1 times [2024-10-14 02:42:50,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:50,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584942516] [2024-10-14 02:42:50,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:50,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 02:42:50,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:42:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:50,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:42:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:42:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:42:50,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:50,851 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 02:42:50,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584942516] [2024-10-14 02:42:50,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584942516] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:50,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376673414] [2024-10-14 02:42:50,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:50,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:50,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:50,854 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:50,855 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:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:51,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:42:51,147 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:51,280 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-14 02:42:51,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:51,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376673414] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:51,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:51,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-14 02:42:51,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391779124] [2024-10-14 02:42:51,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:51,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:51,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:51,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:51,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:42:51,284 INFO L87 Difference]: Start difference. First operand 584 states and 920 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:52,032 INFO L93 Difference]: Finished difference Result 1106 states and 1795 transitions. [2024-10-14 02:42:52,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:52,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2024-10-14 02:42:52,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:52,040 INFO L225 Difference]: With dead ends: 1106 [2024-10-14 02:42:52,040 INFO L226 Difference]: Without dead ends: 592 [2024-10-14 02:42:52,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:42:52,044 INFO L432 NwaCegarLoop]: 833 mSDtfsCounter, 834 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 2113 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:52,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 2113 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 02:42:52,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-10-14 02:42:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2024-10-14 02:42:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 465 states have (on average 1.5806451612903225) internal successors, (735), 480 states have internal predecessors, (735), 99 states have call successors, (99), 28 states have call predecessors, (99), 27 states have return successors, (99), 96 states have call predecessors, (99), 98 states have call successors, (99) [2024-10-14 02:42:52,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 933 transitions. [2024-10-14 02:42:52,149 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 933 transitions. Word has length 101 [2024-10-14 02:42:52,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:52,149 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 933 transitions. [2024-10-14 02:42:52,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 933 transitions. [2024-10-14 02:42:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 02:42:52,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:52,152 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:52,175 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:52,353 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,SelfDestructingSolverStorable17 [2024-10-14 02:42:52,353 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:52,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:52,354 INFO L85 PathProgramCache]: Analyzing trace with hash 448637066, now seen corresponding path program 1 times [2024-10-14 02:42:52,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:52,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217728216] [2024-10-14 02:42:52,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:52,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:52,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:52,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 02:42:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:42:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 02:42:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:42:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 02:42:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 02:42:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,638 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-10-14 02:42:52,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:52,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217728216] [2024-10-14 02:42:52,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217728216] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:52,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066134249] [2024-10-14 02:42:52,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:52,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:52,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:52,641 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:52,643 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:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:52,891 INFO L255 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:42:52,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-14 02:42:52,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:52,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066134249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:52,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:52,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-14 02:42:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661581907] [2024-10-14 02:42:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:52,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:52,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:42:52,977 INFO L87 Difference]: Start difference. First operand 592 states and 933 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:53,482 INFO L93 Difference]: Finished difference Result 1122 states and 1818 transitions. [2024-10-14 02:42:53,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:53,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-10-14 02:42:53,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:53,488 INFO L225 Difference]: With dead ends: 1122 [2024-10-14 02:42:53,488 INFO L226 Difference]: Without dead ends: 600 [2024-10-14 02:42:53,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:42:53,492 INFO L432 NwaCegarLoop]: 830 mSDtfsCounter, 824 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:53,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 2110 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 02:42:53,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-14 02:42:53,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-10-14 02:42:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 472 states have (on average 1.5826271186440677) internal successors, (747), 487 states have internal predecessors, (747), 99 states have call successors, (99), 29 states have call predecessors, (99), 28 states have return successors, (100), 96 states have call predecessors, (100), 98 states have call successors, (100) [2024-10-14 02:42:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 946 transitions. [2024-10-14 02:42:53,631 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 946 transitions. Word has length 104 [2024-10-14 02:42:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:53,631 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 946 transitions. [2024-10-14 02:42:53,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 946 transitions. [2024-10-14 02:42:53,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 02:42:53,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:53,634 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:53,654 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:53,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:53,835 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:53,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:53,835 INFO L85 PathProgramCache]: Analyzing trace with hash 292828456, now seen corresponding path program 1 times [2024-10-14 02:42:53,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:53,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133057281] [2024-10-14 02:42:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:53,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:42:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-14 02:42:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:42:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:42:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 02:42:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:42:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:42:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:42:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:42:54,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 02:42:54,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,092 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 02:42:54,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:42:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133057281] [2024-10-14 02:42:54,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133057281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:42:54,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682297258] [2024-10-14 02:42:54,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:54,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:54,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:42:54,096 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:54,097 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:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:42:54,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 1178 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 02:42:54,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:42:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 02:42:54,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:42:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682297258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:42:54,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:42:54,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-10-14 02:42:54,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350749853] [2024-10-14 02:42:54,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:42:54,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:42:54,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:42:54,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:42:54,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:42:54,430 INFO L87 Difference]: Start difference. First operand 600 states and 946 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:54,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:42:54,904 INFO L93 Difference]: Finished difference Result 1138 states and 1841 transitions. [2024-10-14 02:42:54,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:42:54,904 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2024-10-14 02:42:54,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:42:54,907 INFO L225 Difference]: With dead ends: 1138 [2024-10-14 02:42:54,908 INFO L226 Difference]: Without dead ends: 608 [2024-10-14 02:42:54,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:42:54,910 INFO L432 NwaCegarLoop]: 827 mSDtfsCounter, 812 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:42:54,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 2107 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 02:42:54,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-14 02:42:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2024-10-14 02:42:55,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 479 states have (on average 1.5845511482254697) internal successors, (759), 494 states have internal predecessors, (759), 99 states have call successors, (99), 30 states have call predecessors, (99), 29 states have return successors, (101), 96 states have call predecessors, (101), 98 states have call successors, (101) [2024-10-14 02:42:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 959 transitions. [2024-10-14 02:42:55,034 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 959 transitions. Word has length 107 [2024-10-14 02:42:55,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:42:55,035 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 959 transitions. [2024-10-14 02:42:55,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-14 02:42:55,035 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 959 transitions. [2024-10-14 02:42:55,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 02:42:55,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:42:55,037 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:42:55,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 02:42:55,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:42:55,238 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION === [timeShiftErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:42:55,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:42:55,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1948230334, now seen corresponding path program 1 times [2024-10-14 02:42:55,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:42:55,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116138539] [2024-10-14 02:42:55,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:42:55,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:42:55,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat